DocumentCode
397344
Title
Fast codes for large alphabet sources and its application to block encoding
Author
Ryabko, Boris ; Astola, Jaakko
Author_Institution
Telecommun. & Comput. Sci., Siberian State Univ., Novosibirsk, Russia
fYear
2003
fDate
29 June-4 July 2003
Firstpage
112
Abstract
In this paper we suggest a method of grouping for speeding up codes depending on the alphabet size. The method of grouping is applied to the set of all possible blocks in such a way to reduce redundancy and the computational efficiency of lossless data compression for large alphabets is presented in this paper.
Keywords
block codes; data compression; group codes; redundancy; alphabet size; block encoding; code redundancy; coding speed; computational efficiency; fast code; grouping method; large alphabet source; lossless data compression; Adaptive coding; Application software; Computational efficiency; Data compression; Electronic mail; Encoding; Probability distribution; Signal processing; Signal processing algorithms; Telecommunication computing;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2003. Proceedings. IEEE International Symposium on
Print_ISBN
0-7803-7728-1
Type
conf
DOI
10.1109/ISIT.2003.1228126
Filename
1228126
Link To Document