On the Application of LDPC Codes to Arbitrary Discrete-Memoryless Channels
From MaRDI portal
Publication:3546558
DOI10.1109/TIT.2004.824917zbMATH Open1282.94005OpenAlexW2146774798MaRDI QIDQ3546558FDOQ3546558
Authors: Amir Bennatan, David Burshtein 
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2004.824917
Recommendations
- Low-Density Lattice Codes
- Low-density parity-check codes and the related performance analysis methods
- Low-density parity-check codes based on finite geometries: a rediscovery and new results
- Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding
- The capacity of low-density parity-check codes under message-passing decoding
Cited In (14)
- Gallager error-correcting codes for binary asymmetric channels
- Nonuniform Error Correction Using Low-Density Parity-Check Codes
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
- A coding theorem for lossy data compression by LDPC codes
- An upper bound on error probability in communication systems with single-user reception based on order statistics
- LDPC code design for nonuniform power-line channels
- Codes on sparse graphs for satellite and space communications
- Low-Density Lattice Codes
- Title not available (Why is that?)
- Design of efficiently encodable nonbinary LDPC codes for adaptive coded modulation
- Composition of semi-LTCs by two-wise tensor products
- Basics of secrecy coding
- Characterization and optimization of LDPC codes for the 2-user Gaussian multiple access channel
- LDPC Codes Over the $q$ -ary Multi-Bit Channel
This page was built for publication: On the Application of LDPC Codes to Arbitrary Discrete-Memoryless Channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546558)
