Arithmetic Coding for Countable Alphabet Sources with Finite Precision

スポンサーリンク

概要

• 論文の詳細を見る

• An improved arithmetic coding which provides an encoder with finite calculation precision for source sequences over a countable alphabet is presented. Conventional arithmetic coding theoretically has infinite precision for real variables. However any algorithm implemented on a computer has finite precision. This implies that conventional arithmetic codes can only encode sequences over a finite alphabet. The improved arithmetic coding prosented here has a computational complexity which is roughly proportional to the length of the source sequence for a given source.

• 社団法人電子情報通信学会の論文
• 2001-10-01

著者

• Morita Hiroyoshi

  The Graduate School Of Information Systems University Of Electro-communications

• NISHIARA Mikihiko

  the Graduate School of Information Systems, University of Electro-Communications

• Nishiara Mikihiko

  Graduate School Of Information Systems The University Of Eletro-communications

関連論文

• On Construction of Reversible Variable-Length Codes Including Resynchronization Markers as Codewords
• On Multiple Smoothed Transmission of MPEG4 Video Stream
• On Multiple Smoothed Transmission of MPEG Video Streams(Image Coding, Information Theory and Its Applications)
• Arithmetic Coding for Countable Alphabet Sources with Finite Precision

スポンサーリンク