Construction of binary minimal product parity-check matrices (Q939176): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00200-008-0069-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2053878603 / rank | |||
Normal rank | |||
Revision as of 18:59, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Construction of binary minimal product parity-check matrices |
scientific article |
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
