By Topic

Equidistant binary arithmetic 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)

LetC(B)denote the binary cyclicANcode with generatorA, whereAB=2^{n} - 1. It is known thatC(B)is equidistant ifBis a prime powerp^{k}, where either2or-2is primitive moduloBprovidedpequiv 1 pmod{3}{rm if} k > 1. It is conjectured that these are the onlyBsuch thatC(B)is equidistant. We have verified this forB < 100 000. Several results are established that further limit the possibilities for counterexamples to the conjecture.

Published in:

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