Binary optimal linear codes from posets of the disjoint union of two chains
Information Theory
2019-07-01 v1 Combinatorics
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.
Cite
@article{arxiv.1906.12017,
title = {Binary optimal linear codes from posets of the disjoint union of two chains},
author = {Yansheng Wu and Jong Yoon Hyun and Qin Yue},
journal= {arXiv preprint arXiv:1906.12017},
year = {2019}
}
Comments
4 pages