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

Algorithms to enumerate codewords for DC2-constrained channels

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)
Xin, Y. ; Dept. of Electr. & Comput. Eng., Alberta Univ., Edmonton, Alta., Canada ; Fair, I.J.

We introduce a new method for enumerating codewords that can be applied to DC2-constrained channels. Based on this method, two efficient algorithms for evaluating the number of codewords with specified characteristics are developed. Computer calculation results show that these algorithms are significantly more computationally efficient than other techniques developed to date

Published in:

Information Theory, IEEE Transactions on  (Volume:47 ,  Issue: 7 )

Date of Publication:

Nov 2001

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.