Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

MDS Poset-Codes Satisfying the Asymptotic Gilbert–Varshamov Bound in Hamming Weights

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jong Yoon Hyun ; Inst. of Math. Sci., Seoul, South Korea ; Yoonjin Lee

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.

Published in:

Information Theory, IEEE Transactions on  (Volume:57 ,  Issue: 12 )