Optimal minimal linear codes from posets
SCIE
SCOPUS
- Title
- Optimal minimal linear codes from posets
- Authors
- Hyun, Jong Yoon; Kim, Hyun Kwang; Wu, Yansheng; Yue, Qin
- Date Issued
- 2020-12
- Publisher
- SPRINGER
- Abstract
- Recently, some infinite families of minimal and optimal binary linear codes were constructed from simplicial complexes by Hyun et al. We extend this construction method to arbitrary posets. Especially, anti-chains are corresponded to simplicial complexes. In this paper, we present two constructions of binary linear codes from hierarchical posets of two levels. In particular, we determine the weight distributions of binary linear codes associated with hierarchical posets with two levels. Based on these results, we also obtain some optimal and minimal binary linear codes not satisfying the condition of Ashikhmin-Barg.
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/105410
- DOI
- 10.1007/s10623-020-00793-0
- ISSN
- 0925-1022
- Article Type
- Article
- Citation
- DESIGNS CODES AND CRYPTOGRAPHY, vol. 88, no. 12, page. 2475 - 2492, 2020-12
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.