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

Polynomials for generating selection sets with complementary quotients in guided scrambling line coding

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 $31
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.

Necessary and sufficient conditions are presented which ensure that base polynomials in guided scrambling line coding generate complementary quotients in all quotient selection sets. The relationship between augmenting bit patterns and complementary quotients is also given

Published in:

Electronics Letters  (Volume:37 ,  Issue: 6 )

Date of Publication:

15 Mar 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.