Maximum distance separable poset codes
SCIE
SCOPUS
- Title
- Maximum distance separable poset codes
- Authors
- Hyun, JY; Kim, HK
- Date Issued
- 2008-09
- Publisher
- SPRINGER
- Abstract
- We derive the Singleton bound for poset codes and define the MDS poset codes as linear codes which attain the Singleton bound. In this paper, we study the basic properties of MDS poset codes. First, we introduce the concept of I-perfect codes and describe the MDS poset codes in terms of I -perfect codes. Next, we study the weight distribution of an MDS poset code and show that the weight distribution of an MDS poset code is completely determined. Finally, we prove the duality theorem which states that a linear code C is an MDS P-code if and only if C(perpendicular to) is an MDS (P) over tilde -code, where C(perpendicular to) is the dual code of C and (P) over tilde is the dual poset of P.
- Keywords
- maximum distance separable code; poset code; discrete Poisson summation formula; Moebius inversion formula; CLASSIFICATION
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/22708
- DOI
- 10.1007/s10623-008-9204-8
- ISSN
- 0925-1022
- Article Type
- Article
- Citation
- DESIGNS CODES AND CRYPTOGRAPHY, vol. 48, no. 3, page. 247 - 261, 2008-09
- 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.