On random-access data compaction

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureHoofdstukAcademicpeer review

1 Downloads (Pure)

Samenvatting

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.
Originele taal-2Engels
TitelNumbers, Information and Complexity
RedacteurenI. Althoefer, N. Cai, G. Deck, L. Khachatrian, A. Sarkozy, I. Wegener, Z. Zhang
Plaats van productieDordrecht
UitgeverijKluwer Academic Publishers
Pagina's413-420
Aantal pagina's8
ISBN van geprinte versie0-7923-7765-6
StatusGepubliceerd - 2000

Vingerafdruk

Duik in de onderzoeksthema's van 'On random-access data compaction'. Samen vormen ze een unieke vingerafdruk.

Citeer dit