Construction of binary minimal product parity-check matrices (Q939176)

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\).