Even poset and a parity result for binary linear code (Q855546): 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.1016/j.laa.2006.02.028 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2138795851 / rank | |||
Normal rank | |||
Revision as of 01:04, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Even poset and a parity result for binary linear code |
scientific article |
Statements
Even poset and a parity result for binary linear code (English)
0 references
7 December 2006
0 references
Let \(C\) be a subspace of the space consisting of all binary vectors of a fixed length. The author proves that the sum of all maximal vectors of \(C\) equals the sum of all minimal vectors of \(C\). The concept of even poset is introduced and a duality result is established.
0 references
support
0 references
Eulerian graph
0 references
binary matroid
0 references
minimal vector
0 references
