We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

On extending Goppa codes to cyclic 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)

The class of linear codes introduced by Goppa are noncyclic in general. The only Goppa codes known to be cyclic are the Bose--Chaudhuri-Hocquengbem (BCH) codes which are a special class of Goppa codes. Recently, Berlekamp and Moreno showed that certain double-error-correcting binary Goppa codes become cyclic when extended by an overall parity check. In this correspondence, results of a further investigation on extending Goppa codes to cyclic codes are presented. It is shown that a large class of multiple-error-correcting q -ary Goppa codes also become cyclic when extended by an overall parity check. These Goppa codes are found to be reversible. The Goppa codes considered in this correspondence consist of two subclasses that, after extension, give rise to the two subclasses of reversible cyclic codes of primitive and nonprimitive length, respectively. These cyclic codes are noted to include, respectively, the expurgated Melas codes and the Zetterberg codes as special cases.

Published in:

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