DocumentCode :
1561881
Title :
A new method of optimal coding
Author :
Grigoryan, Artyom M. ; Regentova, Emma E.
Author_Institution :
Department of Electrical and Computer Engineering, Texas Univ., San Antonio, TX, USA
fYear :
2002
Firstpage :
378
Lastpage :
382
Abstract :
A new technique for optimally encoding a given source, statistical properties of which are described by the first-order model is introduced. The calculation of a minimum length of codewords is based on the consecutive redistribution of the self- information of symbols in accordance with their probabilities at each stage of the encoding. The proposed method performs equally well for an arbitrary order of symbol probabilities. While codewords are generated by a separate combinatorial procedure, the overall computational cost of the proposed method is lower than that for the Huffman code.
Keywords :
combinatorial mathematics; probability; source coding; combinatorial procedure; computational cost; first-order model; minimum codeword length; optimal coding; probabilities; source; statistical properties; symbol self-information redistribution; Computational efficiency; Difference equations; Encoding; Entropy; Huffman coding; Information technology; Probability;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Technology: Coding and Computing, 2002. Proceedings. International Conference on
Print_ISBN :
0-7695-1506-1
Type :
conf
DOI :
10.1109/ITCC.2002.1000419
Filename :
1000419
Link To Document :
بازگشت