Binary optimal linear codes are constructed from posets of the disjoint union of two chains.
Grassl, Bounds on the minimum distance of linear codes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Binary optimal linear codes from posets of the disjoint union of two chains
Binary optimal linear codes are constructed from posets of the disjoint union of two chains.