Even poset and a parity result for binary linear code (Q855546)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5077996
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Even poset and a parity result for binary linear code |
scientific article; zbMATH DE number 5077996 |
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
0.6987434029579163
0 references
0.6960903406143188
0 references
0.6861828565597534
0 references
0.684759259223938
0 references
