On random-access data compaction

F.M.J. Willems, T.J. Tjalkens, P.A.J. Volf

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

1 Downloads (Pure)


Consider a binary lID. sequence that consists of K = 2’ 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~+1 variable-length segments. For decod ing 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 ~ log2 N behavior is obtained where N = 2~T. An additional increase of at most one bit per code-segment is possible however.
Original languageEnglish
Title of host publicationNumbers, Information and Complexity
EditorsI. Althoefer, N. Cai, G. Deck, L. Khachatrian, A. Sarkozy, I. Wegener, Z. Zhang
Place of PublicationDordrecht
PublisherKluwer Academic Publishers
Number of pages8
ISBN (Print)0-7923-7765-6
Publication statusPublished - 2000


Dive into the research topics of 'On random-access data compaction'. Together they form a unique fingerprint.

Cite this