By Topic

Codes on the Klein quartic, ideals, and decoding (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

1 Author(s)

A sequence of codes with particular symmetries and with large rates compared to their minimal distances is constructed over the field GF (2^{3}) . In the sequence there is, for instance, a code of length 21 and dimension 10 with minimal distance 9 , and a code of length 21 and dimension 16 with minimal distance 3 . The codes are constructed from algebraic geometry using the dictionary between coding theory and algebraic curves over finite fields established by Goppa. The curve used in the present work is the Klein quartic. This curve has the maximal number of rational points over GF (2^{3}) allowed by Serre's improvement of the Hasse-Weil bound, which, together with the low genus, accounts for the good code parameters. The Klein quartic has the Frobenius group G of order 21 acting as a group of automorphisms which accounts for the particular symmetries of the codes. In fact, the codes are given alternative descriptions as left ideals in the group-algebra GF (2^{3})[G] . This description allows for easy decoding. For instance, in the case of the single error correcting code of length 21 and dimension 16 with minimal distance 3 . decoding is obtained by multiplication with an idempotent in the group algebra.

Published in:

Information Theory, IEEE Transactions on  (Volume:33 ,  Issue: 6 )