Abstract
Consider a binary I.I.D. sequence that consists of K = 2J blocks of length T. We are looking for a universal compaction method that allows us to decode a certain block by looking only at certain segments in the codesequence. We have investigated a hierarchical method that encodes the source sequence into a codesequence that consists of 2J+1 variable-length segments. For decoding a certain block only J + 2 segments need to be accessed. During decoding it is always clear where the next segment that needs to be accessed appears in the codesequence. The cumulative individual redundancy that is achieved by this method, is optimal in the sense that ½ log 2 N behavior is obtained where N = 2J T. An additional increase of at most one bit per code-segment is possible however.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
T.M. Cover, “Enumerative Source Encoding,” IEEE Trans. Inform. Theory, 19, 1973, 73–77.
R.E. Krichevsky and V.K. Trofimov, “The Performance of Universal Encoding,” IEEE Trans. Inform. Theory, 27, 1981, 199–207.
J. Rissanen, “Universal Coding, Information, Prediction, and Estimation,” IEEE Trans. Inform. Theory, 30, 1984, 629–636.
J.P.M. Schalkwijk, “An Algorithm for Source Coding,” IEEE Trans. Inform. Theory, 30, 1972, 395–399.
C.E. Shannon, “A Mathematical Theory of Communication,” Bell Sys. Tech. J., 27, 1948, 379–424 and 623–657.
F.M.J. Willems, Y.M. Shtarkov and Tj.J. Tjalkens, “The Context Tree Weighting Method: Basic properties,” IEEE Trans. on Inform. Theory, 41, 1995, 653–664.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Willems, F.M.J., Tjalkens, T.J., Volf, P.A.J. (2000). On Random-Access Data Compaction. In: Althöfer, I., et al. Numbers, Information and Complexity. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6048-4_35
Download citation
DOI: https://doi.org/10.1007/978-1-4757-6048-4_35
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4967-7
Online ISBN: 978-1-4757-6048-4
eBook Packages: Springer Book Archive