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

Constant weight codes: An approach based on Knuth's balancing method

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)
Skachek, V. ; Coordinated Sci. Lab., Univ. of Illinois, Urbana-Champaign, Urbana, IL, USA ; Schouhamer Immink, Kees A.

In this article, we study properties and algorithms for constructing sets of `constant weight' codewords with bipolar symbols, where the sum of the symbols is a constant q, q ≠ 0. We show various code constructions that extend Knuth's balancing vector scheme, q = 0, to the case where q >; 0. We compute the redundancy of the new coding methods.

Published in:

Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on

Date of Conference:

July 31 2011-Aug. 5 2011

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.