By Topic

The Poset Metrics That Allow Binary Codes of Codimension m to be m -, (m-1) -, or (m-2) -Perfect

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)
Kim, H.K. ; Dept. of Math., Pohang Univ. of Sci. & Technol., Pohang ; Krotov, D.S.

A binary poset code of codimension m (of cardinality 2n-m, where n is the code length) can correct maximum m errors. All possible poset metrics that allow codes of codimension m to be m-, (m-1)-, or (m-2)-perfect are described. Some general conditions on a poset which guarantee the nonexistence of perfect poset codes are derived; as examples, we prove the nonexistence of r-perfect poset codes for some r in the case of the crown poset and in the case of the union of disjoint chains.

Published in:

Information Theory, IEEE Transactions on  (Volume:54 ,  Issue: 11 )