Decoding LDPC Codes Over Integer Residue Rings

DOI10.1109/TIT.2006.881732MaRDI QIDQ3548018zbMATH OpenOpenAlexFDO

Authors

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

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Decoding (94B35)

Recommendations

• List decoding of convolutional codes over integer residue rings
• Generalization of low rank parity-check (LRPC) codes over the ring of integers modulo a positive integer
• On the decoding of Reed-Solomon and BCH codes over integer residue rings
• A matrix based list decoding algorithm for linear codes over integer residue rings
• LDPC Block and Convolutional Codes Based on Circulant Matrices

Cited in

(5)

• Generalization of low rank parity-check (LRPC) codes over the ring of integers modulo a positive integer
• A matrix based list decoding algorithm for linear codes over integer residue rings
• Decoding of redundant residue polynomial codes using Euclid's algorithm
• Integer Ring Sieve for Constructing Compact QC-LDPC Codes With Girths 8, 10, and 12
• On lattice constructions D and D^ from q-ary linear codes

This page was built for publication: Decoding LDPC Codes Over Integer Residue Rings

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