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

On the nonperiodic cyclic equivalence classes of Reed-Solomon codes

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)
Song, H.Y. ; Dept. of EE-Syst., Univ. of Southern California, Los Anglees, CA ; Golomb, S.W.

Picking up exactly one member from each of the nonperiodic cyclic equivalence classes of an (n, k+1) Reed-Solomon code E over GF(q) gives a code, E", which has bounded Hamming correlation values and the self-synchronizing property. The exact size of E" is shown to be (1/n) Σd|n μ(d)q1+kd/, where μ(d) is the Mobius function, (x) is the integer part of x, and the summation is over all the divisors d of n=q-1. A construction for a subset V of E is given to prove that |E"|⩾|V|=(qk+1-q k+1-N)/(q-1) where N is the number of integers from 1 to k which are relatively prime to q-1. A necessary and sufficient condition for |E"|=| V| is proved and some special cases are presented with examples. For all possible values of q>2, a number B(q) is determined such that |E"|=|V| for 1 ⩽kB(q ) and |E"|>|V| for k>B( q)

Published in:

Information Theory, IEEE Transactions on  (Volume:39 ,  Issue: 4 )

Date of Publication:

Jul 1993

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.