ISSN 0032-9460, Problems of Information Transmission, 2013, Vol. 49, No. 4, pp. 348–353.


c Pleiades Publishing, Inc., 2013.
Original Russian Text 
c S.V. Bezzateev, N.A. Shekhunova, 2013, published in Problemy Peredachi Informatsii, 2013, Vol. 49, No. 4, pp. 57–63.

CODING THEORY

A New Subclass of Cyclic Goppa Codes

S. V. Bezzateev and N. A. Shekhunova
St. Petersburg State University of Aerospace Instrumentation
bsv@aanet.ru sna@delfa.net
Received March 12, 2013; in final form, October 1, 2013

Abstract—We propose a subclass of cyclic Goppa codes given by separable self-reciprocal

Goppa polynomials of degree two. We prove that this subclass contains all reversible cyclic
codes of length n, n | (q m ± 1), with a generator polynomial g(x), g(α±i ) = 0, i = 0, 1, αn = 1,
α ∈ GF (q 2m ).
DOI: 10.1134/S0032946013040054

1. INTRODUCTION
It is known [1] that Goppa codes, also called (L, G)-codes, are defined by
• Goppa polynomial G(x) of degree t with coefficients in GF (q m );
• Locator set L. In the case of a classical Goppa code, L = {α1 , α2 , . . . , αn }, where αi = αj ,
G(αi ) = 0, αi ∈ GF (q m ).
A Goppa code consists of all q-ary vectors a = (a1 , a2 , . . . , an ) satisfying the condition


n
1
ai ≡ 0 mod G(x).
i=1
x − αi

It was found in [1] that the only cyclic subclass of Goppa codes consists of codes with Goppa
polynomial G(x) = xt and with a cyclically consistent locator set L ⊆ GF (q m ) \ {0}. This class
is formed by primitive BCH codes (narrow-sense BCH codes [2]). In 1973, an extension of two-
error-correcting binary Goppa codes was proposed in [3] (see also [2]). Goppa polynomials of these
codes are separable polynomials of degree two of the form G(x) = x2 + Ax + 1, A ∈ GF (2m ), the
locator set is L = GF (2m ) ∪ {∞}, and all codewords have even weight. Further this result was
generalized to nonbinary codes [2–8], and it was proved that there are cyclic codes among extended
Goppa codes. They are given by a separable self-reciprocal Goppa polynomial, and each codeword

n
a = (a1 a2 . . . an ) satisfies the relation ai = 0. Codes of this class are invariant under the
i=1
permutation group PGL(2, GF (q m )) [9]:
 
aζ + b
PGL(2, GF (q m )) = ψ(ζ) = , ζ ∈ L, a, b, c, d ∈ GF (q m ), ad − bc = 0 .
cζ + d

This group contains a permutation which is a single cycle involving all elements of the set L =
GF (q m ) ∪ {∞}. Thus, elements of L can be reordered so that they become cyclically consistent.
One can easily check that the parity-check matrix of such a code is of the form
 
H(L,G) 0
HE = ,
1 ... 1 1

348
 A NEW SUBCLASS OF CYCLIC GOPPA CODES 349

where H(L,G) is the parity-check code of a separable Goppa code with polynomial G(x) of degree
two and L ⊆ GF (q m ).
In [10], a slightly different construction was considered, which yielded another class of cyclic
Goppa codes, also given by the same Goppa polynomial but with a parity-check matrix of the form
 
H(L,G)
HP C = .
1 ... 1

As was shown in [9,11], this class of codes is constructed as the cyclic subclass of classical Goppa

n
codes all of whose codewords a = (a1 , a2 , . . . , an ) satisfy ai = 0.
i=1
In the present paper we show that the above-mentioned extended codes and codes obtained by

n
adding the parity check ai = 0 are representatives of the class of classical Goppa codes given by
i=1
a self-reciprocal separable Goppa polynomial and a consistently chosen locator set L with elements
in GF (q 2m ).
Definition 1 [2]. A Goppa code is said to be separable if the polynomial G(x) has no multiple
roots.
Definition 2 [2]. A code is said to be reversible if along with any codeword a = (a1 , a2 , . . . , an )
 = (an , an−1 , . . . , a2 , a1 ).
it also contains the codeword a

2. SUBCLASS OF CYCLIC REVERSIBLE SEPARABLE GOPPA CODES

We consider the possibility to consistently choose a set L and a polynomial G(x) so that all

n
codewords a = (a1 , a2 , . . . , an ) of the obtained (L, G)-code satisfy the relation ai = 0 without
i=1
adding extra rows or columns to its parity-check matrix.
Lemma 1. Any separable polynomial G(x), deg G(x) = 2, with coefficients in GF (q m ) can be
represented as G(x) = x2 + Ax + 1, A ∈ GF (q m ).
Consider an (L, G)-code with

G(x) = x2 + Ax + 1, A ∈ GF (q m ),
L = {α1 , α2 . . . , αn−1 , αn } ⊂ GF (q 2m ), αn = 1, n ≤ q m + 1, (1)
qm
αi = α−1
i = αn−i , G(αi ) = 0, αi = αj , ∀i, j ∈ {1, . . . , n − 1}.

Clearly, the Goppa polynomial from (1) can be written as

G(x) = (x − β)(x − β −1 ), β ∈ GF (q 2m ), β + β −1 = −A. (2)

Taking into account that A ∈ GF (q m ), we obtain β q + β −q = −A.

m m

m m
Then (β q − β)(β q +1 − 1) = 0. Hence, we have either
m
βq = β (3)

or
m +1
βq = 1. (4)
Lemma 2. The parity-check matrix of an (L, G)-code defined by (1) contains the all-one row,
and the code redundancy is r ≤ 2m + 1.

PROBLEMS OF INFORMATION TRANSMISSION Vol. 49 No. 4 2013

350 BEZZATEEV, SHEKHUNOVA

Proof. For the proof, we use the approach proposed in [12]. Consider the parity-check matrix
of the code:
⎡ ⎤
1 1 1 1
⎢ α21 + Aα1 + 1 ...
2
α2 + Aα2 + 1 2
αn−1 + Aαn−1 + 1 α2n + Aαn + 1 ⎥
H=⎢
⎣ α1 α2 αn−1 αn
⎥.
⎦
2 2 ... 2 2
α1 + Aα1 + 1 α2 + Aα2 + 1 αn−1 + Aαn−1 + 1 αn + Aαn + 1
By raising each element of the first row of H to the power q m , we obtain
 q m
1 1 1 1
2 . . .
α1 + Aα1 + 1 α22 + Aα2 + 1 α2n−1 + Aαn−1 + 1 α2n + Aαn + 1
 
α21 α22 α2n−1 α2n
= 2 . . . .
α1 + Aα1 + 1 α22 + Aα2 + 1 α2n−1 + Aαn−1 + 1 α2n + Aαn + 1
Note that a linear combination of the obtained row with the first and second rows of H gives the
all-one row:
   
α21 + Aα1 + 1 α22 + Aα2 + 1 α2n−1 + Aαn−1 + 1 α2n + Aαn + 1
... = 1 1 ... 1 1 .
α21 + Aα1 + 1 α22 + Aα2 + 1 α2n−1 + Aαn−1 + 1 α2n + Aαn + 1
Hence we obtain that the parity-check matrix of the considered (L, G)-code (1) consists of two
rows, one of them being the all-one row:
⎡ 1 1 1 1 ⎤
...
H = ⎣ α1 + Aα1 + 1 α2n + Aαn + 1 ⎦ .
2 2
α2 + Aα2 + 1 2
αn−1 + Aαn−1 + 1
1 1 ... 1 1
Hence, the redundancy satisfies r ≤ 2m + 1. 
Lemma 3. An (L, G)-code defined by (1) is a reversible code.
Proof. To prove the lemma, it suffices to raise each element of H to the power q m :
⎛⎡ 1 1 1 1 ⎤⎞q m
...
(H)q
m
= ⎝⎣ α2 + Aα + 1
1 1 α22 + Aα2 + 1 α2n−1 + Aαn−1 + 1 α2n + Aαn + 1 ⎦⎠
1 1 ... 1 1
⎡ 1 1 1 1 ⎤
...
= ⎣ α2n−1 + Aαn−1 + 1 α2n−2 + Aαn−2 + 1 α21 + Aα1 + 1 α2n + Aαn + 1 ⎦ . 
1 1 ... 1 1
Theorem. A separable (L, G)-code with
G(x) = x2 + Ax + 1 = (x − β)(x − β −1 ), β ∈ GF (q 2m ), A ∈ GF (q m ),
L = {α1 , α2 . . . , αn−1 , αn } ⊂ GF (q 2m ), αn = 1, n = q m ± 1,
qm
αi = α−1
i = αn−i , G(αi ) = 0, αi = αj , ∀i, j ∈ {1, . . . , n},
is a cyclic reversible Goppa code.
Proof. The reversibility was proved in Lemma 3.
To prove the cyclicity, we use the approach proposed in [5] and consider the parity-check ma-
trix H of the code (1) in the form
⎡ ⎤
1 1 ... 1 1
⎢ ⎥
⎢ 1 1 1 1 ⎥
⎢ ... ⎥
H = ⎢ β − α1 β − α2 β − αn−1 β−1 ⎥ .
⎢ ⎥
⎣ 1 1 1 1 ⎦
...
β −1 − α1 β −1 − α2 β −1 − αn−1 β −1 − 1

PROBLEMS OF INFORMATION TRANSMISSION Vol. 49 No. 4 2013

 A NEW SUBCLASS OF CYCLIC GOPPA CODES 351

Now, using a linear combination of rows of H, rewrite this as follows:

⎡ ⎤
1 1 ... 1 1
⎢ ⎥
⎢ β2 − 1 β2 − 1 β2 − 1 β2 − 1 ⎥
⎢ −β −β ... −β −β ⎥
⎢ β − α1 β − α2 β − αn−1 β−1 ⎥.
⎢ ⎥
⎣ β −2 − 1 β −2 − 1 β −2 − 1 −2
β −1 ⎦
− β −1 − β −1 ... − β −1 − β −1
β −1 − α1 β −1 − α2 β −1 − αn−1 β −1 − 1

Hence we obtain
⎡ ⎤
1 1 ... 1 1 1
⎢ α β−1 α2 β − 1 αn−2 β − 1 αn−1 β − 1 ⎥
⎢ 1 ⎥
⎢ ... 1⎥
H = ⎢ β − α1 β − α2 β − αn−2 β − αn−1 ⎥.
⎢ ⎥
⎣ α1 β −1 − 1 α2 β −1 − 1 αn−2 β −1 − 1 αn−1 β −1 − 1 ⎦
... 1
β −1 − α1 β −1 − α2 β −1 − αn−2 β −1 − αn−1

Obviously, we have

αi β − 1 αj β − 1 αi β −1 − 1 αj β −1 − 1
= and −1
= −1 , ∀i = j ∈ {1, . . . , n}.
β − αi β − αj β − αi β − αj

Now consider two possible cases, (3) and (4), for the Goppa polynomial G(x).
m
Case 1. β q = β, i.e., β ∈ GF (q m ), and the code length is n = q m + 1.
In this case,
  m  
αi β − 1 q α−1
i β−1 αi β − 1 −1
= = ,
β − αi β − α−1
i β − αi
and therefore  q m +1
αi β − 1
= 1, ∀i ∈ {1, . . . , n}.
β − αi
αi β − 1
Denote ηi = , i = 1, . . . , n. Note that the number of different elements ηi distinct from 1 is
β − αi
m
n − 1 = q m , and ηiq +1 = 1.
For β −1 , we obtain similar relations:
 q m +1
αi β −1 − 1
= 1, ∀i ∈ {1, . . . , n};
β −1 − αi

furthermore,
 −1
αi β −1 − 1 αi β − 1
= = ηi−1 .
β −1 − αi β − αi
The parity-check matrix of the reversible separable (L, G)-code is then rewritten as
⎡ ⎤
1 1 ... 1 1 1  
⎢η ⎥
η2 . . . ηn−2 ηn−1 1⎦ = 1 1 . . . 1 1 1
H=⎣ 1 .
−1 −1 −1 −1 η1 η2 . . . ηn−2 ηn−1 1
η1 η2 . . . ηn−2 ηn−1 1

It is easily seen that H coincides up to row permutations with the matrix HRC , the parity-check
matrix of a reversible cyclic code of length n = q m + 1 with generator polynomial g(x):
m +1
g(αi ) = 0, i = 0, 1, α ∈ GF (q 2m ), αq = 1.

PROBLEMS OF INFORMATION TRANSMISSION Vol. 49 No. 4 2013

352 BEZZATEEV, SHEKHUNOVA
m
Case 2. β q +1 = 1.
In this case the code length is n = q m − 1, since the locator set L = {α1 , α2 . . . , αn−1 , αn } ⊂
m
GF (q 2m ), αqi +1 = 1, ∀i ∈ 1, . . . , n, does not contain roots of G(x) by the definition of an
(L, G)-code.
Consider entries of the parity-check matrix of this code:
 q m
αi β − 1 α−1
i β
−1 − 1 1 − αi β αi β − 1
= −1 = α − β = β − α .
β − αi −1
β − αi i i

Hence,
αi β − 1
= γi ∈ GF (q m ), ∀i ∈ {1, . . . , n}.
β − αi
Similarly to Case 1, for β −1 we obtain
 −1
αi β −1 − 1 αi β − 1
= ;
β −1 − αi β − αi
αi β −1 − 1
i.e., = γi−1 .
β −1 − αi
The parity-check matrix
⎡ ⎤
1 1 ... 1 1 1
⎢γ γ2 . . . γn−2 γn−1 1⎥
H=⎣ 1 ⎦ = HRC
−1 −1 −1 −1
γ1 γ2 . . . γn−2 γn−1 1

of such a reversible separable (L, G)-code equals the parity-check matrix HRC of the reversible
cyclic code of length n = q m − 1 with generator polynomial g(x):

g(α±i ) = 0,
m −1
i = 0, 1, α ∈ GF (q m ), αq = 1. 

Corollary. All reversible cyclic codes of length n, n | (q m ± 1), with generator polynomials g(x)
such that g(η ±i ) = 0, i = 0, 1, η ∈ GF (q 2m ), η n = 1, can be described as classical Goppa codes with
G(x) = x2 + Ax + 1, A ∈ GF (q m ), with an appropriately chosen locator set L.
Proof. Consider two cases:
1. The length n of a reversible cyclic code is a divisor of q m + 1. We specify the loca-
tor set using elements η i , i = 1, . . . n, where η ∈ GF (q 2m ) and η n = 1. Using the theorem
proved above, we construct the corresponding cyclic reversible separable (L, G)-code by choos-
ing a polynomial G(x) = (x − β)(x − β −1 ) such
m

m
that β q = β, i.e., β ∈ GF (q m ), and the set
L = {α1 , α2 , . . . αn−2 , αn−1 , 1} ⊂ GF (q 2m ), αi = α−1
q
i = αn−i , αi = αj , ∀i = j ∈ {1, . . . , n − 1},
α−1
i β−1
such that = η i , i = 1, . . . , n − 1.
β − α−1
i
2. The length n of a reversible cyclic code is a divisor of q m − 1. We specify the locator set
using elements γ i , i = 1, . . . , n, γ ∈ GF (q m ) and γ n = 1. Then the corresponding cyclic reversible
separable (L, G)-code is defined by a polynomial G(x) = (x−β)(x−β −1 ), β ∈ GF (q 2m ), β q +1 = 1,
m

and the locator set

L = {α1 , α2 , . . . αn−2 , αn−1 , 1} ⊂ GF (q 2m ),
m
αqi = α−1
i = αn−i , αi = αj , ∀i = j ∈ {1, . . . , n − 1},
α−1
i β −1
= γi, i = 1, . . . , n − 1. 
β − α−1
i

PROBLEMS OF INFORMATION TRANSMISSION Vol. 49 No. 4 2013

 A NEW SUBCLASS OF CYCLIC GOPPA CODES 353

3. CONCLUSION
We note in conclusion that the proposed subclass of cyclic reversible separable classical Goppa
codes includes all presently known extended cyclic Goppa codes and coincides with the subclass
of reversible BCH codes. The question of whether there exist nonreversible cyclic Goppa codes
remains open. In other words, this is the question of whether there exists a permutation group
containing a single-cycle permutation such that a classical Goppa code is invariant with respect to
it and its Goppa polynomial is not reversible.
The author is sincerely grateful to participants of the Coding Theory seminar (Institute for
Information Transmission Problems, Russian Academy of Sciences) and to a reviewer for valuable
remarks and advice on presentation of results of this paper.

REFERENCES
1. Goppa, V.D., A New Class of Linear Correcting Codes, Probl. Peredachi Inf., 1970, vol. 6, no. 3,
pp. 24–30 [Probl. Inf. Trans. (Engl. Transl.), 1970, vol. 6, no. 3, pp. 207–212].
2. MacWilliams, F.J. and Sloane, N.J.A., The Theory of Error-Correcting Codes, Amsterdam: North-
Holland, 1977. Translated under the title Teoriya kodov, ispravlyayushchikh oshibki, Moscow: Svyaz’,
1979.
3. Berlecamp, E.R. and Moreno, O., Extended Double-Error-Gorrecting Binary Goppa Codes Are Cyclic,
IEEE Trans. Inform. Theory, 1973, vol. 19, no. 6, pp. 817–818.
4. Tzeng, K.K. and Yu, C.Y., Characterization Theorems for Extending Goppa Codes to Cyclic Codes,
IEEE Trans. Inform. Theory, 1979, vol. 25, no. 2, pp. 246–250.
5. Tzeng, K.K. and Zimmermann, K., On Extending Goppa Codes to Cyclic Codes, IEEE Trans. Inform.
Theory, 1975, vol. 21, no. 6, pp. 712–716.
6. Moreno, O., Symmetries of Binary Goppa Codes, IEEE Trans. Inform. Theory, 1979, vol. 25, no. 5,
pp. 609–612.
7. Vishnevetskii, A.L., On Cyclicity of Extended Goppa Codes, Probl. Peredachi Inf., 1982, vol. 18, no. 3,
pp. 14–18 [Probl. Inf. Trans. (Engl. Transl.), 1982, vol. 18, no. 3, pp. 171–175].
8. Stichtenoth, H., Which Extended Goppa Codes are Cyclic?, J. Combin. Theory, Ser. A, 1989, vol. 51,
no. 2, pp. 205–220.
9. Berger, T.P., Goppa and Related Codes Invariant Under a Prescribed Permutation, IEEE Trans. Inform.
Theory, 2000, vol. 46, no. 7, pp. 2628–2633.
10. Berger, T.P., New Classes of Cyclic Extended Goppa Codes, IEEE Trans. Inform. Theory, 1999, vol. 45,
no. 4, pp. 1264–1266.
11. Berger, T.P., On the Cyclicity of Goppa Codes, Parity-Check Subcodes of Goppa Codes, and Extended
Goppa Codes, Finite Fields Appl., 2000, vol. 6, no. 3, pp. 255–281.
12. Bezzateev, S.V. and Shekhunova, N.A., Subclass of Binary Goppa Codes with Minimal Distance Equal
to the Design Distance, IEEE Trans. Inform. Theory, 1995, vol. 41, no. 2, pp. 554–555.

PROBLEMS OF INFORMATION TRANSMISSION Vol. 49 No. 4 2013