Construction of binary minimal product parity-check matrices

DOI10.1007/S00200-008-0069-XMaRDI QIDQ939176zbMATH OpenOpenAlexFDO

Authors Morteza Esmaeili

Publication date 21 August 2008

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00200-008-0069-x

zbMATH Keywords

Minimal parity check matrixproduct code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Review text

Given a linear code \(C\), a parity check matrix of \(C\) is called \textit{minimal} if it has the minimum number of nonzero entries among all the parity check matrices of \(C\). This article shows how to construct a minimal parity check matrix of a binary product code \(C_1\otimes C_2\) from minimal parity check matrices of \(C_1\) and \(C_2\).

Recommendations

• On full-rank parity-check matrices of product codes
• Binary set functions and parity check matrices
• On sparse parity check matrices
• Sparse Parity-Check Matrices over ${GF(q)}$
• Construction of some binary linear codes of minimum distance five

Cites work

• A recursive approach to low complexity codes
• Algebraic coding theory
• Introduction to Coding Theory
• Iterative decoding of binary block and convolutional codes

Cited in

(2)

• On full-rank parity-check matrices of product codes
• Binary set functions and parity check matrices

This page was built for publication: Construction of binary minimal product parity-check matrices

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