Advertisement

On Random-Access Data Compaction

  • Frans M. J. Willems
  • Tjalling J. Tjalkens
  • Paul A. J. Volf
Chapter

Abstract

Consider a binary I.I.D. sequence that consists of K = 2 J 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 2 J+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 = 2 J T. An additional increase of at most one bit per code-segment is possible however.

Keywords

Access Structure Source Sequence Prefix Code Extra Block Code Probability 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    T.M. Cover, “Enumerative Source Encoding,” IEEE Trans. Inform. Theory, 19, 1973, 73–77.MathSciNetMATHCrossRefGoogle Scholar
  2. [2]
    R.E. Krichevsky and V.K. Trofimov, “The Performance of Universal Encoding,” IEEE Trans. Inform. Theory, 27, 1981, 199–207.MathSciNetMATHCrossRefGoogle Scholar
  3. [3]
    J. Rissanen, “Universal Coding, Information, Prediction, and Estimation,” IEEE Trans. Inform. Theory, 30, 1984, 629–636.MathSciNetMATHCrossRefGoogle Scholar
  4. [4]
    J.P.M. Schalkwijk, “An Algorithm for Source Coding,” IEEE Trans. Inform. Theory, 30, 1972, 395–399.CrossRefGoogle Scholar
  5. [5]
    C.E. Shannon, “A Mathematical Theory of Communication,” Bell Sys. Tech. J., 27, 1948, 379–424 and 623–657.Google Scholar
  6. [6]
    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.MATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2000

Authors and Affiliations

  • Frans M. J. Willems
    • 1
  • Tjalling J. Tjalkens
    • 1
  • Paul A. J. Volf
    • 1
  1. 1.Eindhoven Univ. of TechnologyElectrical Engineering DepartmentEindhovenThe Netherlands

Personalised recommendations