Construction of binary minimal product parity-check matrices (Q939176)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Construction of binary minimal product parity-check matrices |
scientific article; zbMATH DE number 5314966
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Construction of binary minimal product parity-check matrices |
scientific article; zbMATH DE number 5314966 |
Statements
Construction of binary minimal product parity-check matrices (English)
0 references
21 August 2008
0 references
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\).
0 references
Minimal parity check matrix
0 references
product code
0 references
0.7497425675392151
0 references
0.7216066122055054
0 references
