Sciweavers

76 search results - page 5 / 16
» Random codes: Minimum distances and error exponents
Sort
View
SIAMDM
2008
105views more  SIAMDM 2008»
13 years 6 months ago
Average Spectra and Minimum Distances of Low-Density Parity-Check Codes over Abelian Groups
Ensembles of regular low-density parity-check codes over any finite Abelian group G are studied. The nonzero entries of the parity matrix are randomly chosen, independently and uni...
Giacomo Como, Fabio Fagnani
CORR
2006
Springer
79views Education» more  CORR 2006»
13 years 6 months ago
On the structure of generalized toric codes
Toric codes are obtained by evaluating rational functions of a nonsingular toric variety at the algebraic torus. One can extend toric codes to the so called generalized toric code...
Diego Ruano
DCC
2005
IEEE
14 years 6 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
GLOBECOM
2008
IEEE
13 years 7 months ago
Distance-Enhancing Constrained Codes for Optical Recording Channels
Abstract— This paper proposes distance-enhancing constrained codes for optical recording channels. The repeated minimum transition runlength (RMTR) constraints are first investi...
Kui Cai, Kees A. Schouhamer Immink, Zhiliang Qin
VTC
2007
IEEE
14 years 1 months ago
Distance Spectrum Calculation of Symbol Punctured Trellis Coded Modulation
— A special kind of symbol-wise puncturing is applied to the code symbols of a constituent trellis coded modulation (TCM) within two very bandwidth-efficient concatenated coding...
Axel Hof