Emergent Mind
Binary optimal linear codes from posets of the disjoint union of two chains
(1906.12017)
Published Jun 28, 2019
in
cs.IT
,
math.CO
,
and
math.IT
Abstract
Recently, Chang and Hyun obtained some classes of binary optimal codes via simplicial complexes. In this letter, we utilize posets of the disjoint union of two chains to construct binary optimal linear codes.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.