IEEE Communications Letters · 2004 · 192 citations · 12 references
EngineeringComputer EngineeringComputer ScienceDigital CommunicationChannel CapacityChannel CodingCoding TheoryError Control CodingError-correcting CodesFinite Blocklength Information TheoryBlock CodesBlock CodingCode ConstructionsFinite Blocklength CodingLdpc CodesLow-density Parity-check CodesParity Check CodesParity-check Matrices
Progressive-edge-growth (PEG) algorithm is known to construct low-density parity-check codes at finite block lengths with very good performance. In this letter, we propose a very simple modification to PEG construction for irregular codes, which considerably improves the performance at high signal-to-noise (SNR) ratios with no sacrifice in low-SNR performance.
12
Low-density parity-check codes
Robert G. Gallager · IEEE Transactions on Information Theory · 1962 · 10.6K citations · Full text