Sciweavers

23 search results - page 3 / 5
» Perfect binary codes: bounds and properties
Sort
View
CORR
2007
Springer
155views Education» more  CORR 2007»
13 years 5 months ago
Low-density graph codes that are optimal for source/channel coding and binning
We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-...
Martin J. Wainwright, Emin Martinian
CORR
2007
Springer
97views Education» more  CORR 2007»
13 years 5 months ago
Side-information Scalable Source Coding
Abstract—We consider the problem of side-information scalable (SI-scalable) source coding, where the encoder constructs a two-layer description, such that the receiver with high ...
Chao Tian, Suhas N. Diggavi
ECCC
2011
188views ECommerce» more  ECCC 2011»
13 years 22 days ago
Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length
Locally decodable codes are error correcting codes with the extra property that, in order to retrieve the correct value of just one position of the input with high probability, it...
Anna Gál, Andrew Mills
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 5 months ago
On Network-Error Correcting Convolutional Codes under the BSC Edge Error Model
Convolutional network-error correcting codes (CNECCs) are known to provide error correcting capability in acyclic instantaneous networks within the network coding paradigm under sm...
K. Prasad, B. Sundar Rajan
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 3 months ago
Coding for High-Density Recording on a 1-D Granular Magnetic Medium
In terabit-density magnetic recording, several bits of data can be replaced by the values of their neighbors in the storage medium. As a result, errors in the medium are dependent ...
Arya Mazumdar, Alexander Barg, Navin Kashyap