\(q\)-ary LDPC code
A \(q\)-ary linear code with a sparse parity-check matrix. Alternatively, a member of an infinite family of \([n,k,d]_q\) codes for which the number of nonzero entries in each row and column of the parity-check matrix are both bounded above by a constant as \(n\to\infty\).
A parity check is performed by taking the inner product of a row of the parity-check matrix with a codeword that has been affected by a noise channel. A parity check yields either zero (no error) or a nonzero field element (error). Despite the fact that there is more than one nonzero outcome, \(q>2g\)-ary linear codes with sparse parity-check matrices are also called LDPC codes.
- Tanner code — \(q\)-ary LDPC codes are \(q\)-ary Tanner codes on sparse bipartite graphs whose constraint nodes represent \(q\)-ary parity-check codes.
- \(q\)-ary LDGM code — The dual of a \(q\)-ary LDPC code has a sparse generator matrix and is called a \(q\)-ary LDGM code.
- M. C. Davey and D. J. C. MacKay, “Low density parity check codes over GF(q)”, 1998 Information Theory Workshop (Cat. No.98EX131) DOI
Page edit log
- Victor V. Albert (2023-05-04) — most recent
“\(q\)-ary LDPC code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2023. https://errorcorrectionzoo.org/c/q-ary_ldpc