Title :
On the OPTA function for lossless compression of individual sequences via recursive sequential codes
Author :
Kieffer, John ; Yang, En-hui
Author_Institution :
Dept. of Electr. Eng., Minnesota Univ., Minneapolis, MN, USA
fDate :
27 Jun-1 Jul 1994
Abstract :
The OPTA (optimum performance theoretically attainable) function for lossless compression of individual sequences is investigated. This function gives the optimum asymptotic rate in bits per source symbol at which each individual sequence can be losslessly compressed via sequential codes whose encoding and decoding operations can be described in terms of recursive functions. Two results are described: (1) no sequential code yields asymptotic rate equal to that of the OPTA function for every individual sequence, and (2) the OPTA function cannot be expressed in terms of Kolmogorov complexity
Keywords :
data compression; recursive functions; sequential codes; sequential decoding; source coding; OPTA function; bits per source symbol; decoding; encoding; lossless compression; optimum asymptotic rate; optimum performance theoretically attainable; recursive functions; recursive sequential codes; source coding; Bars; Binary sequences; Decoding; Delay; Encoding;
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
DOI :
10.1109/ISIT.1994.394964
