Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding
From MaRDI portal
Publication:3547746
DOI10.1109/TIT.2004.828066zbMATH Open1303.94140MaRDI QIDQ3547746FDOQ3547746
Authors: Bane Vasić, Olgica Milenkovic
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Recommendations
- Construction of Low-Density Parity-Check Codes Based on Balanced Incomplete Block Designs
- Low-density parity-check codes based on finite geometries: a rediscovery and new results
- scientific article; zbMATH DE number 1982620
- Geometric constructions of Gallager codes
- scientific article; zbMATH DE number 2127872
Cited In (30)
- Construction of minimum bandwidth regenerating codes with combinatorial design
- High-rate LDPC codes from partially balanced incomplete block designs
- Low-Density Lattice Codes
- Construction of LDPC convolutional codes via difference triangle sets
- New class of quantum codes constructed from cyclic difference set
- Nonexistence of sparse triple systems over abelian groups and involutions
- Title not available (Why is that?)
- On the Application of LDPC Codes to Arbitrary Discrete-Memoryless Channels
- LDPC codes: A group algebra formulation
- Title not available (Why is that?)
- LDPC code designs, constructions, and unification
- High-throughput architectures for circular block-type low-density parity-check codes
- Super-simple \((v, 5, 2)\) directed designs and their smallest defining sets with application in LDPC codes
- MaxMinSum Steiner systems for access balancing in distributed storage
- Title not available (Why is that?)
- Construction of Low-Density Parity-Check Codes Based on Balanced Incomplete Block Designs
- Composition of Low-Error 2-Query PCPs Using Decodable PCPs
- Verification-Based Decoding for Packet-Based Low-Density Parity-Check Codes
- Results on Punctured Low-Density Parity-Check Codes and Improved Iterative Decoding Techniques
- Low-Density Parity-Check Lattices: Construction and Decoding Analysis
- Design of LDPC codes using iterative-filled method
- Plateaued functions and one-and-half difference sets
- On Algebraic Construction of Gallager and Circulant Low-Density Parity-Check Codes
- The construction of low-density parity-check codes based on protograph
- On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size
- On the girth of Tanner \((3,11)\) quasi-cyclic LDPC codes
- Construction of rate-compatible LDPC codes utilizing information shortening and parity puncturing
- Title not available (Why is that?)
- Construction of short block length,high rate low-density parity-check codes based on cyclic difference families
- Geometric constructions of Gallager codes
This page was built for publication: Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547746)