Artículo de publicación ISIWe present a new variable-length encoding scheme for sequences of integers, Directly Addressable Codes (DACs), which enables direct access to any element of the encoded sequence without the need of any sampling method. Our proposal is a kind of implicit data structure that introduces synchronism in the encoded sequence without using asymptotically any extra space. We show some experiments demonstrating that the technique is not only simple, but also competitive in time and space with existing solutions in several applications, such as the representation of LCP arrays or high-order entropy-compressed sequences
Distributed Arithmetic Coding (DAC) is an effective technique for implementing Slepian-Wolf coding (...
Fibonacci codes are self-synchronizing variable-length codes that are proven useful for their robust...
Abstract—A joint source-channel coding problem that com-bines the efficient compression of discrete ...
We present a new variable-length encoding scheme for sequences of integers, Directly Ad-dressable Co...
AbstractA synchronization scheme is necessary when variable length codes are used in the presence of...
AbstractSeveral measures are defined and investigated, which allow the comparison of codes as to the...
The aim of this chapter is to present, in appropriate perspective, some selected topics in the theor...
International audienceThis paper describes a family of codes for entropy coding of memoryless source...
A method is presented for finding the shortest variable length codes with a given bit per symbol rat...
We use the "conservation of entropy" [1] to derive a simple formula for the redundancy of...
This paper proposes a universal variable-length lossless compression algorithm based on fountain cod...
Variable-length T-Codes may be used to provide robust compression for data communication and storage...
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In ...
International Telemetering Conference Proceedings / October 09-11, 1973 / Sheraton Inn Northeast, Wa...
Pas toutes les techniques de compression des données adoptent le principe de dictionnaire pour repré...
Distributed Arithmetic Coding (DAC) is an effective technique for implementing Slepian-Wolf coding (...
Fibonacci codes are self-synchronizing variable-length codes that are proven useful for their robust...
Abstract—A joint source-channel coding problem that com-bines the efficient compression of discrete ...
We present a new variable-length encoding scheme for sequences of integers, Directly Ad-dressable Co...
AbstractA synchronization scheme is necessary when variable length codes are used in the presence of...
AbstractSeveral measures are defined and investigated, which allow the comparison of codes as to the...
The aim of this chapter is to present, in appropriate perspective, some selected topics in the theor...
International audienceThis paper describes a family of codes for entropy coding of memoryless source...
A method is presented for finding the shortest variable length codes with a given bit per symbol rat...
We use the "conservation of entropy" [1] to derive a simple formula for the redundancy of...
This paper proposes a universal variable-length lossless compression algorithm based on fountain cod...
Variable-length T-Codes may be used to provide robust compression for data communication and storage...
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In ...
International Telemetering Conference Proceedings / October 09-11, 1973 / Sheraton Inn Northeast, Wa...
Pas toutes les techniques de compression des données adoptent le principe de dictionnaire pour repré...
Distributed Arithmetic Coding (DAC) is an effective technique for implementing Slepian-Wolf coding (...
Fibonacci codes are self-synchronizing variable-length codes that are proven useful for their robust...
Abstract—A joint source-channel coding problem that com-bines the efficient compression of discrete ...