Cart (Loading....) | Create Account
Close category search window
 

Bounds and constructions for binary asymmetric error-correcting codes (Corresp.)

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)

By use of known bounds on constant-weight binary codes, new uppper bounds are obtained on the cardinality of binary codes correcting asymmetric errors. Some constructions are exhibited that come close to these bounds. For single-error-correcting codes some constructions are derived from the Steiner systemS(5, 6,12), and for double-error-correcting codes some constructions are derived from the Nordstrom-Robinson code.

Published in:

Information Theory, IEEE Transactions on  (Volume:27 ,  Issue: 1 )

Date of Publication:

Jan 1981

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.