By Topic

Duadic 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

3 Author(s)

A new family of binary cyclic (n,(n + 1)/2) and (n,(n - 1)/2) codes are introduced, which include quadratic residue (QR) codes when n is prime. These codes are defined in terms of their idempotent generators, and they exist for all odd n = p_{1}^{a_{1}} p_{2}^{a_{2}} \cdots p_{r}^{a_{r}} where each p_{i} is a prime \equiv pm 1 \pmod {8} . Dual codes are identified. The minimum odd weight of a duadic (n,(n + 1)/2) code satisfies a square root bound. When equality holds in the sharper form of this bound, vectors of minimum weight hold a projective plane. The unique projective plane of order 8 is held by the minimum weight vectors in two inequivalent (73,37,9) duadic codes. All duadic codes of length less than 127 are identified, and the minimum weights of their extensions are given. One of the duadic codes of length 113 has greater minimum weight than the QR code of that length.

Published in:

Information Theory, IEEE Transactions on  (Volume:30 ,  Issue: 5 )