Weighted Nonbinary Repeat–Accumulate Codes

DOI10.1109/TIT.2004.825255MaRDI QIDQ3547837zbMATH OpenOpenAlexFDO

Authors Kyeongcheol Yang

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

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40) Other types of codes (94B60)

Recommendations

• scientific article; zbMATH DE number 1504647
• Polynomial weights and code constructions
• Optimization design of a class of generalized RA codes
• Error bounds for repeat-accumulate codes decoded via linear programming
• Accumulate–Repeat–Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity

Cited in

(2)

• Optimization design of a class of generalized RA codes
• scientific article; zbMATH DE number 1504647 (Why is no real title available?)

This page was built for publication: Weighted Nonbinary Repeat–Accumulate Codes

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