On random-access data compaction

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

1 Citation (Scopus)

Abstract

Consider a binary i.i.d. sequence that consists of K=2/sup 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 code sequence. We have investigated a hierarchical method that encodes the source sequence into a code sequence that consists of 2/sup 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 code sequence. The cumulative individual redundancy that is achieved by this method, is optimal in the sense that 1/2 log/sub 2/ N behavior is obtained where N=2/sup J/T. An additional increase of at most one bit per code-segment is possible however.
Original languageEnglish
Title of host publicationProceedings of the 1999 IEEE Information Theory and Communications Workshop
EditorsF. Swarts, J. Swarts
PublisherInstitute of Electrical and Electronics Engineers
Pages97-97
Number of pages1
ISBN (Print)0-7803-5268-8
DOIs
Publication statusPublished - 1999
Eventconference; Information Theory and Communications Workshop, IEEE 1999, Kruger National Park, S. Africa, 20-25 June 1999 -
Duration: 1 Jan 1999 → …

Conference

Conferenceconference; Information Theory and Communications Workshop, IEEE 1999, Kruger National Park, S. Africa, 20-25 June 1999
Period1/01/99 → …
OtherInformation Theory and Communications Workshop, IEEE 1999, Kruger National Park, S. Africa, 20-25 June 1999

Fingerprint

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

Cite this