Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)
DOI: 10.1109/itcom.1999.781412
View full text |Buy / Rent full text
|
Sign up to set email alerts
|

Abstract: Arithmetic Coding is generalized to provide a method for transforming source output sequences into sequences whose probability distribution approaches any desired probability distribution. A further modification in which gaps are introduced between source intervals allows arithmetic encoders to produce code sequences with any information rate, enabling the encoder to perform joint source-chan-ne1 coding. The results of a simulation are presented where arithmetic coding is used as a channel encoder in conjuncti… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
5
0

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 10 publications
(5 citation statements)
references
References 4 publications
0
5
0
Order By: Relevance
“…The larger the FS probability, the higher the redundancy and the robustness against errors. This idea is extended in [25], which proposes the introduction of multiple FSs (MFS). All these FS techniques can be applied to IAC [26] leading to JSC-IAC.…”
Section: Introductionmentioning
confidence: 99%
“…The larger the FS probability, the higher the redundancy and the robustness against errors. This idea is extended in [25], which proposes the introduction of multiple FSs (MFS). All these FS techniques can be applied to IAC [26] leading to JSC-IAC.…”
Section: Introductionmentioning
confidence: 99%
“…This is not the case for I 0 and I 1 , which have to be connected intervals. In [3], it is shown that by adapting the configuration of I 0 , I 1 , and I FS , one may in principle implement any block or convolutional code with an arithmetic code.…”
Section: Design Of Robust Ac Using Distance Propertiesmentioning
confidence: 99%
“…In [3], Sayir considered the arithmetic encoder as a channel encoder and added redundancy in the transmitted bitstream by introducing gaps in the coding space; he also proposed to use the stack sequential decoding algorithm. In [5], Pettijohn et al used both depth-first and breadth-first sequential decoding, where error detection was again achieved by testing the presence of a FS in the decoded bitstream.…”
mentioning
confidence: 99%
“…The proposed schemes consider finite state representations for the arithmetic decoding machine to apply well-known algorithms used in channel decoding such as Viterbi, List-Viterbi [9][10][11][12][13][14][15]. In [9], an AC that embeds channel coding is presented to enforce a minimum Hamming distance between encoded sequences, then a Maximum A Posteriori (MAP) estimator is proposed for arithmetic decoding.…”
Section: Introductionmentioning
confidence: 99%
“…In [10,11], sequential decoding schemes were applied on binary trees and path pruning technique was used based on the forbidden symbol error detection. Sayir [12] used an arithmetic encoder adding redundancy in the compressed bit-stream by introducing gaps in the coding space, and performs sequential decoding. In [13], authors used Bayesian networks to model the quasiarithmetic encoder, and considered adding redundancy by introducing synchronization markers.…”
Section: Introductionmentioning
confidence: 99%