Design Methods for Irregular Repeat–Accumulate Codes

DOI10.1109/TIT.2004.831778MaRDI QIDQ3547567zbMATH OpenFDO

Authors Aline Roumy, Souad Guemghar, Sergio Verdú, Giuseppe Caire

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.831778

zbMATH Keywords

Belief propagationchannel capacitycodesdensity evolutionlow-density parity-checkstabilitythresholdturbo codes

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Combined modulation schemes (including trellis codes) in coding theory (94B12) Decoding (94B35)

Recommendations

• Complexity Versus Performance of Capacity-Achieving Irregular Repeat–Accumulate Codes on the Binary Erasure Channel
• Design of capacity-approaching irregular low-density parity-check codes
• scientific article; zbMATH DE number 1504647
• Optimization design of a class of generalized RA codes
• Accumulate–Repeat–Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity

Cited in

(4)

• Optimized design for accumulate rateless codes with iterative decoding number constraint
• Complexity Versus Performance of Capacity-Achieving Irregular Repeat–Accumulate Codes on the Binary Erasure Channel
• Optimization design of a class of generalized RA codes
• LDPC code design for nonuniform power-line channels

This page was built for publication: Design Methods for Irregular Repeat–Accumulate Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547567)