Linear-congruence constructions of low-density parity-check codes

MaRDI QIDQ2776516zbMATH OpenFDO

Authors James W. Bond, Stefen Hui, Hank Schmidt

Publication date 18 March 2002

zbMATH Keywords

decodingiterative belief propagation algorithmlinear congruencelow-density parity-check codespermutation matricessymmetric channel model

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Linear codes (general theory) (94B05) Decoding (94B35)

Recommendations

• Performance of low-density parity-check codes with linear minimum distance
• Efficient encoding of low-density parity-check codes
• Improved low-density parity-check codes using irregular graphs
• Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding
• Low density parity check codes based on sparse matrices with no small cycles

Cited in

(7)

• Low-density parity-check codes based on Steiner systems and permutation matrices
• scientific article; zbMATH DE number 6672322 (Why is no real title available?)
• Linear codes from a generic construction
• Recursive construction of LDPC codes
• Low density parity check codes based on sparse matrices with no small cycles
• LDPC code design for nonuniform power-line channels
• Improved construction of LDPC convolutional codes with semi-random parity-check matrices

This page was built for publication: Linear-congruence constructions of low-density parity-check codes

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