Results 1  10
of
437
Finite Blocklength SlepianWolf Coding
"... Abstract—We characterize the fundamental limits for distributed lossless source coding (SlepianWolf) in the finite blocklength regime. We introduce a fundamental quantity known as the entropy dispersion matrix, which is analogous to scalar dispersion quantities. We show that if this matrix is pos ..."
Abstract
 Add to MetaCart
Abstract—We characterize the fundamental limits for distributed lossless source coding (SlepianWolf) in the finite blocklength regime. We introduce a fundamental quantity known as the entropy dispersion matrix, which is analogous to scalar dispersion quantities. We show that if this matrix
Nested Linear/Lattice Codes for Structured Multiterminal Binning
, 2002
"... Network information theory promises high gains over simple pointtopoint communication techniques, at the cost of higher complexity. However, lack of structured coding schemes limited the practical application of these concepts so far. One of the basic elements of a network code is the binning sch ..."
Abstract

Cited by 345 (14 self)
 Add to MetaCart
scheme. Wyner and other researchers proposed various forms of coset codes for efficient binning, yet these schemes were applicable only for lossless source (or noiseless channel) network coding. To extend the algebraic binning approach to lossy source (or noisy channel) network coding, recent work
Code and parse trees for lossless source encoding
 Communications in Information and Systems
, 2001
"... This paper surveys the theoretical literature on fixedtovariablelength lossless source code trees, called code trees, and on variablelengthtofixed lossless sounce code trees, called parse trees. Huffman coding [ l] is the most well known code tree problem, but there are a number of interestin ..."
Abstract

Cited by 62 (1 self)
 Add to MetaCart
This paper surveys the theoretical literature on fixedtovariablelength lossless source code trees, called code trees, and on variablelengthtofixed lossless sounce code trees, called parse trees. Huffman coding [ l] is the most well known code tree problem, but there are a number
Universal Lossless Source Coding With the Burrows Wheeler Transform
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2002
"... The Burrows Wheeler Transform (BWT) is a reversible sequence transformation used in a variety of practical lossless sourcecoding algorithms. In each, the BWT is followed by a lossless source code that attempts to exploit the natural ordering of the BWT coefficients. BWTbased compression schemes ar ..."
Abstract

Cited by 44 (4 self)
 Add to MetaCart
The Burrows Wheeler Transform (BWT) is a reversible sequence transformation used in a variety of practical lossless sourcecoding algorithms. In each, the BWT is followed by a lossless source code that attempts to exploit the natural ordering of the BWT coefficients. BWTbased compression schemes
Lossless coding for distributed streaming sources
 IEEE Trans. Inform. Theory
"... Distributed source coding is traditionally viewed in the block coding context — all the source symbols are known in advance at the encoders. This paper instead considers a streaming setting in which iid source symbol pairs are revealed to the separate encoders in real time and need to be reconstruct ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Distributed source coding is traditionally viewed in the block coding context — all the source symbols are known in advance at the encoders. This paper instead considers a streaming setting in which iid source symbol pairs are revealed to the separate encoders in real time and need
NetworkAware Lossless Source Coding
"... Wireless sensor networks for environmental monitoring have unusual characteristics and must meet a unique set of requirements. Data rates are extremely low, but limits on energy usage and total deployment cost dominate. Probably the most important metric is the average energy required to deliver a ..."
Abstract
 Add to MetaCart
;home" node. This paper describes a methodology for source coding of environmental sensor network data that exploits correlation in temporal and spatial domains. Our approach is an adaptive twolevel scheme. The first level is modelbased in that the time series from a sensor is approximated by a polynomial
Lossless and near lossless source coding for multiple access networks
 IEEE Trans. Inform. Theory
, 2003
"... Abstract—A multiple access source code (MASC) is a source code designed for the following network configuration: a pair of correlated information sequences ..."
Abstract

Cited by 22 (3 self)
 Add to MetaCart
Abstract—A multiple access source code (MASC) is a source code designed for the following network configuration: a pair of correlated information sequences
Source model aided lossless turbo source coding
 in Proc. Int. Symp. on Turbo Codes and Related Topics
, 2006
"... The integration of a source model into lossless source coding based on punctured turbo codes is considered. We use the turbo principle to iteratively estimate the source statistics and to compensate the errors due to compression. In order to cope with the critical part of joint estimation and decodi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The integration of a source model into lossless source coding based on punctured turbo codes is considered. We use the turbo principle to iteratively estimate the source statistics and to compensate the errors due to compression. In order to cope with the critical part of joint estimation
Lossless Coding with Generalized Criteria
"... Abstract—This paper presents prefix codes which minimize various criteria constructed as a convex combination of maximum codeword length and average codeword length, or, a convex combination of the average of an exponential function of the codeword length and the average codeword length. This frame ..."
Abstract
 Add to MetaCart
work encompasses as a special case several criteria previously investigated in the literature, while relations to universal coding is discussed. The coding algorithm derived is parametric resulting in readjusting the initial source probabilities via a weighted probability vector according to a merging rule
Results 1  10
of
437