scientific article; zbMATH DE number 1504647

MaRDI QIDQ4502607zbMATH OpenFDO

Authors Hui Jin, Robert J. McEliece

Publication date 28 July 2002

zbMATH Keywords

AWGN channelchannel capacityRA codesrepeat-accumulate codesturbo-like codes

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Accumulate–Repeat–Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity
• Weighted Nonbinary Repeat–Accumulate Codes
• Error bounds for repeat-accumulate codes decoded via linear programming
• The serial concatenation of rate-1 codes through uniform random interleavers
• The capacity of low-density parity-check codes under message-passing decoding

Cited in

(10)

• Generalized crossover product accumulate codes
• Product Accumulate Codes: A Class of Codes With Near-Capacity Performance and Low Decoding Complexity
• Design Methods for Irregular Repeat–Accumulate Codes
• Complexity Versus Performance of Capacity-Achieving Irregular Repeat–Accumulate Codes on the Binary Erasure Channel
• Weighted Nonbinary Repeat–Accumulate Codes
• Accumulate–Repeat–Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity
• Optimization design of a class of generalized RA codes
• Lattice codes can achieve capacity on the AWGN channel
• The serial concatenation of rate-1 codes through uniform random interleavers
• Error bounds for repeat-accumulate codes decoded via linear programming

This page was built for publication:

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