MDS poset-codes satisfying the asymptotic Gilbert-Varshamov bound in hamming weights

Jong Yoon Hyun, Yoonjin Lee

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

We prove that MDS linear poset-codes satisfy Gilbert-Varshamov bound for their Hamming weights asymptotically. We also construct MDS linear poset-codes on arbitrary poset-metric spaces by using the Dilworth's chain decomposition theorem and results about the Hermite interpolation problem over a finite field. We prove that there exist linear poset-codes with large weights for both poset-metrics and Hamming metrics, as well.

Original languageEnglish
Article number6094282
Pages (from-to)8021-8026
Number of pages6
JournalIEEE Transactions on Information Theory
Volume57
Issue number12
DOIs
StatePublished - Dec 2011

Keywords

  • Gilbert-Varshamov bound
  • MDS poset-code
  • NRT-metric
  • poset-isometry
  • poset-metric

Fingerprint

Dive into the research topics of 'MDS poset-codes satisfying the asymptotic Gilbert-Varshamov bound in hamming weights'. Together they form a unique fingerprint.

Cite this