DocumentCode
3384579
Title
On the average redundancy rate of adaptive block codes under mixed sources
Author
Reznik, Yuriy A. ; Anisimov, Anatoly V.
Author_Institution
RealNetworks, Inc., Seattle, WA, USA
fYear
2003
fDate
25-27 March 2003
Firstpage
447
Abstract
Summary form only given. The average redundancy rate of Krichevsky´s sample-based universal block codes was analyzed, in a situation wherein the samples and block codes for compression were produced from two different memoryless sources. It was proven that the average redundancy rate of adaptive block codes O/sub /spl lscr/,T/, constructed using samples of length /spl lscr/ from a source T, were used to encode block codes of length n from a source S. The adaptive block codes, constructed using samples from a source T and applied to a source S, have achieved lower average redundancy than universal codes.
Keywords
adaptive codes; block codes; memoryless systems; redundancy; source coding; Krichevsky´s codes; adaptive block codes; average redundancy rate; memoryless sources; mixed sources; universal block codes; Block codes; Cybernetics; Data compression; Encoding; Entropy; Information theory; Network address translation; Redundancy; Source coding;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Compression Conference, 2003. Proceedings. DCC 2003
Conference_Location
Snowbird, UT, USA
ISSN
1068-0314
Print_ISBN
0-7695-1896-6
Type
conf
DOI
10.1109/DCC.2003.1194066
Filename
1194066
Link To Document