IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 67, NO.

10, OCTOBER 2021 6619

Hulls of Generalized Reed-Solomon Codes via

Goppa Codes and Their Applications
to Quantum Codes
Yanyan Gao , Qin Yue , Xinmei Huang, and Jun Zhang

Abstract— A Goppa code over Fq m is a well-known subclass of reduction step, which increases the decoding radius of binary
algebraic error-correcting code. If m = 1, then it is a generalized Goppa codes. Bezzateev and Noskov [1] considered the Goppa
Reed-Solomon(GRS) code and its dual code is called a GRS code codes, their decoding algorithms, their application in practice,
via a Goppa code. In this paper, we give a necessary and sufficient
condition that the dual codes of GRS codes via (expurgated) and also the special properties of using the Patterson algorithm
Goppa codes are also GRS codes via Goppa codes. Under the in the case of its use for decoding separable binary Goppa
above condition, we show that the hulls of GRS codes via Goppa codes. Wang [33] constructed a new family of codes: linearized
codes are still GRS codes via Goppa codes. As an application, Goppa codes embedded with Hamming and rank metric, and
we characterize LCD GRS codes and self-dual GRS codes under determined their parameters.
the above condition. Some numerical examples are also presented
to illustrate our main results. Moreover, we also apply our Let C be a linear code over the finite field Fq , and let C ⊥ be
result to entanglement-assisted quantum error correcting codes the dual code of C with respect to certain inner product, such
(EAQECCs) and obtain two new families of MDS EAQECCs as Euclidean inner product and Hermitian inner product.  The
with arbitrary parameters. hull of C is just defined as the intersection Hull(C) = C C ⊥ .
Index Terms— Goppa codes, generalized Reed-Solomon(GRS) Some research topics in coding theory are closely related to the
code, hull, LCD codes, self-dual codes, entanglement-assisted properties of the hull of a linear code. Sangwisuta et al. [27]
quantum error correcting codes (EAQECCs). studied the hulls of cyclic and negacyclic codes of length
n over the finite field Fq with respect to the Euclidean and
I. I NTRODUCTION Hermitian inner products. Euclidean and Hermitian hulls of
MDS codes were also investigated in [9]. Liu and Pan [20]
G OPPA codes [10] are a well-known class of codes with,
among others, applications in code-based cryptography,
which are subfield subcodes of generalized Reed-Solomon
showed that the dimension of the -Galois hull of a linear code
is invariant under permutation equivalence and they provided
(GRS) codes [32]. Therefore, every Goppa code of length n a method to calculate the dimension of the -Galois hull by
over Fq is a subfield subcode of a generalized RS code in the generator matrix of the code. Ding and Lu [7] investigated
Fnqm and can be decoded with any RS decoder. Goppa codes the Galois hulls of cyclic codes over Frq and presented some
can be decoded by code specific algorithms. Patterson [26] sufficient and necessary conditions that cyclic codes have l-
introduced an algorithm with an extra key equation degree dimensional s-Galois hull with s ≤ r. Du et al. [8] studied
the hulls of BCH codes and their parameters were also
Manuscript received August 18, 2020; revised January 16, 2021; accepted investigated.
April 16, 2021. Date of publication April 20, 2021; date of current version
September 15, 2021. This work was supported in part by the National Natural It is worth mentioning that two special cases of the hulls of
Science Foundation of China under Grant 61772015, Grant 11971321, and linear codes are of much interest. One is that Hull(C) = {0},
Grant 11961050; in part by the Fundation of Nanjing Institute of Technology in which C is called a linear complementary dual (LCD)
under Grant CKJB202007; in part by the Guangxi Natural Science Foundation
under Grant 2020GXNSFAA159053; in part by the National Key Research code. In [23], Massey first introduced this class of codes
and Development Program of China under Grant 2018YFA0704703; and and proved that there exists asymptotically good LCD codes.
in part by the Foundation of Science and Technology on Information Assur- In [18], Li et al. showed some families of LCD cyclic
ance Laboratory under Grant KJ-17-010. (Corresponding author: Qin Yue.)
Yanyan Gao is with the Department of Mathematics, Nanjing University code over finite fields and gave their parameters. Jin con-
of Aeronautics and Astronautics, Nanjing 211100, China, and also with the structed several classes of LCD MDS codes by using two
Department of Mathematics and Physics, Nanjing Institute of Technology, classes of generalized Reed-Solomon codes [15]. Then, Chen
Nanjing 211167, China (e-mail: [email protected]).
Qin Yue is with the Department of Mathematics, Nanjing University and Liu constructed some new LCD MDS codes by a dif-
of Aeronautics and Astronautics, Nanjing 211100, China, and also with ferent approach from generalized Reed-Solomon codes [6].
the State Key Laboratory of Cryptology, Beijing 100878, China (e-mail: The other case is that dim Hull(C) = n2 for n is even
[email protected]).
Xinmei Huang is with the Department of Mathematics, Jinling Institute of (i.e., C = C ⊥ ). Such codes are called self-dual codes.
Technology, Nanjing 211169, China (e-mail: [email protected]). In [16], Jin and Xing determined the existence of q-ary
Jun Zhang is with the School of Mathematical Sciences, Capital Normal MDS self-dual codes for various lengths. Moreover, some
University, Beijing 100048, China (e-mail: [email protected]).
Communicated by G. Matthews, Associate Editor for Coding Theory. other classes of LCD and self-dual codes were explicitly
Digital Object Identifier 10.1109/TIT.2021.3074526 constructed in [13], [28], [29], [35].
0018-9448 © 2021 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.
See https://www.ieee.org/publications/rights/index.html for more information.

Authorized licensed use limited to: University of the Phillippines Diliman. Downloaded on January 31,2024 at 04:58:08 UTC from IEEE Xplore. Restrictions apply.
6620 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 67, NO. 10, OCTOBER 2021

Brun et al. [5] introduced entanglement-assisted quantum A Goppa code [10], [22] is defined by a locator set L and
error-correcting codes (EAQECCs), which include the stan- a Goppa polynomial g(x).
dard quantum stabilizer codes as a special case. They showed Definition 2.1: Let g(x) be a monic polynomial of degree
that: an EAQECC is MDS if and only if the corresponding k over Fqm . Let L = {α1 , α2 , . . . , αn } be a set of n distinct
classical linear code is MDS. However, in general, the deter- elements of Fqm such that g(αi ) = 0 for 1 ≤ i ≤ n. The
mination of the number of shared pairs that required to Goppa code Γ(L, g) is defined as
construct an EAQECC is a difficult thing. Guenda et al. [12] n
ci
proved that this number can be evaluated by the dimension of Γ(L, g) = {c = (c1 , c2 , . . . , cn ) ∈ Fnq | ≡0
the hull of classical linear codes. Luo et al. [21] presented i=1
x − αi
several classes of generalized Reed-Solomon(GRS) codes mod g(x)}. (1)
and extended GRS codes with Euclidean hulls of arbitrary 
The expurgated subcode Γ(L, g) of Γ(L, g) is defined as
dimensions and constructed some families of q-ary MDS
EAQECCs. Very recently, Fang et al. [9] investigated GRS 
n

Γ(L, g) = {c = (c1 , c2 , . . . , cn ) ∈ Γ(L, g)| ci = 0}. (2)
codes and extended GRS codes, where they can determine
i=1
the dimensions of their Euclidean hulls or Hermitian hulls,
and obtained several new families of MDS EAQECCs with The Goppa code Γ(L, g) in Definition 2.1 is the linear code
flexible parameters. Hence, it is important to determine the over Fq of length n = |L|, dimension k  ≥ n − mk, and
hulls of linear codes, in particular for MDS codes. minimum distance d  ≥ k + 1 (see [22]).
The Goppa code Γ(L, g) is a class of linear codes with a By [32, P. 142], the Goppa code is given by
locator set L and a Goppa polynomial g(x). In this paper, Γ(L, g) = {c = (c1 , c2 , . . . , cn ) ∈ Fnq | GcT = 0},
we always assume that m is a positive integer, Fqm is a finite
where the parity check matrix is
field of characteristic p. For m = 1, we give a necessary ⎛ ⎞
and sufficient condition that the dual codes of GRS codes g1 g2 ··· gn
⎜ g1 α1 g α
2 2 · · · g n αn ⎟
via Goppa codes are also GRS codes via (expurgated) Goppa ⎜ ⎟
G=⎜ .. .. .. ⎟,
codes. Under the above condition, we show that the hulls of ⎝ . . . ⎠
GRS codes via Goppa codes are still GRS codes via Goppa g1 αk−1 g α k−1
· · · g α k−1
1 2 2 n n
codes. As an application, we characterize LCD GRS codes and
self-dual GRS codes under the above condition. Some numer- gi = g(αi )−1 , 1 ≤ i ≤ n. (3)
ical examples are also presented to illustrate our main results. Example 2.2: [32, Expample 9.2.6] It is easy to see
Moreover, we also apply our result to entanglement-assisted that if we take the Goppa polynomial g(x) = xκ−1 and
quantum error correcting codes (EAQECCs) and obtain two L = {β −i |1 ≤ i ≤ n}, where β is a primitive nth root of
new families of MDS EAQECCs with arbitrary parameters. unity in Fqm , the resulting Goppa code Γ(L, g) is the narrow
The present paper is organized as follows. In Section II, sense BCH code of designed distance κ.
we give a review of some properties of GRS codes and Goppa It is well-known that the Goppa codes are a class of
codes and some other preliminaries. We give a necessary and important subfield subcodes. Their dimensions and generator
sufficient condition that the dual codes of GRS codes via matrices cannot be determined in general. However, there are
Goppa codes are also GRS codes via (expurgated) Goppa some research results about the long Goppa codes. A new
codes. In Section III, we show that the hulls of GRS codes via bound on the minimum distance of the dual code of a long
Goppa codes are still GRS codes via Goppa codes under the binary Goppa code was discussed in [24], [25]. In [17], Levy-
above condition. We present four special cases of the hulls of dit-Vehel and Litsyn further explored parameters of Goppa
GRS codes via Goppa codes. Some numerical examples (for codes and gave new estimates. New lower bounds on the
example: self-dual GRS codes) are also presented to illustrate covering radius for different subclasses of irreducible Goppa
our main results. In Section IV, we propose two families of codes were obtained in [2].
MDS EAQECCs. In Section V, we make a conclusion. Moreover, there are many research results about the expur-
gated subcode from a classical Goppa code [3], [4], [31].
II. P RELIMINARIES Let Γ(L, g) has the parity check matrix G in (3). Then the
expurgated Goppa code Γ(L, g) has the parity check matrix
In this section, we review some basic notations and some
= 1 ··· 1
basic knowledge. In particular, we introduce GRS codes and G
G
Goppa codes.
By the elementary row operations,
⎛ ⎞
g1 g2 ··· gn
A. GRS Codes and Goppa Codes ⎜ g1 α1 ⎟
⎜ g2 α2 ··· gn αn ⎟
Let Fqm be a finite extension of a field Fq , where q is
G=⎜ ⎜
.. .. .. ⎟
⎟,
a prime power. A linear code C of length n, dimension k ⎜ . . . ⎟
⎝ g1 αk−1 g2 α2k−1 · · · gn αk−1 ⎠
and minimum distance d over Fq is denoted by [n, k, d] or 1 n
[n, k]. Goppa codes are important linear codes applied to g1 αk1 g2 αk2 · · · gn αkn
cryptography. gi = g(αi )−1 , 1 ≤ i ≤ n. (4)

Authorized licensed use limited to: University of the Phillippines Diliman. Downloaded on January 31,2024 at 04:58:08 UTC from IEEE Xplore. Restrictions apply.
GAO et al.: HULLS OF GRS CODES VIA GOPPA CODES AND THEIR APPLICATIONS TO QUANTUM CODES 6621

Definition 2.3: Let L = {α1 , α2 , . . . , αn } be a set of n where ti , si (1 ≤ i ≤ n) ∈ F∗q , β0 , . . . , βk−1 and γ0 , . . . , γk−1
distinct elements of Fq . For a vector v = (v1 , v2 , . . . , vn ) ∈ are row vectors of A and B, respectively. Then there exists
(F∗q )n and an integer k ≥ 0, we define a generalized λ ∈ F∗q such that ti = λsi , for all 1 ≤ i ≤ n.
Reed-Solomon code as Proof: Since A and B are the generator matrices of C,
we have
Gk (L, v) = {(v1 f (α1 ), v2 f (α2 ), . . . , vn f (αn )) :
f (x) ∈ Fq [x], deg(f ) < k}. (5) SpanFq {β0 , β1 , . . . , βk−1 } = SpanFq {γ0 , γ1 , . . . , γk−1 }.

In Definition 2.1, if m = 1, deg(g(x)) = k, and v = Without loss of generality, we assume β0 ∈

(g(α1 )−1 , g(α2 )−1 , . . . , g(αn )−1 ), then the dual codes of SpanFq {γ0 , γ1 , . . . , γk−1 }. Then there exist

Γ(L, g) and Γ(L, g) are Gk (L, v) and Gk+1 (L, v), respec- a0 , a1 , . . . , ak−1 ∈ Fq such that
tively. Moreover, Γ⊥ (L, g) and Γ  ⊥ (L, g) are called the GRS
β0 = (t1 , t2 , . . . , tn ) = (a0 , a1 , . . . , ak−1 )B,
code via the Goppa code and the GRS code via the expurgated
Goppa code, respectively, and denoted by i.e., there exists f1 (x) = a0 + a1 x + · · · + ak−1 xk−1 ∈ Fq [x]
 ⊥ (L, g).
Gk (L, g)  Γ⊥ (L, g), Gk+1 (L, g)  Γ (6) such that
si f1 (αi ) = ti , 1 ≤ i ≤ n.
It is clear that Gk (L, g) has the generator matrix G in (3)
and Gk+1 (L, g) has the generator matrix G  in (4). In this Similarly, by βk−1 ∈ SpanFq {γ0 , γ1 , . . . , γk−1 }, there exists
paper, we shall investigate the GRS codes Gk (L, g) and f2 (x) = b0 + b1 x + · · · + bk−1 xk−1 ∈ Fq [x] such that
Gk+1 (L, g) with deg(g(x)) = k.
si f2 (αi ) = ti αk−1
i , 1 ≤ i ≤ n.
Lemma 2.4: [15, Lemma 5] Let Gk (L, g) be the GRS
code via the Goppa code in Definition 2.3, deg(g(x)) = k,
n
Hence f1 (αi )αk−1
i = f2 (αi ), 1 ≤ i ≤ n. Let F (x) =
m(x) = (x − αi ) a polynomial over Fq , gi  g(αi )−1 , and f1 (x)xk−1 − f2 (x). Then F (x) = 0 has n distinct zeros:
i=1
1
αi , 1 ≤ i ≤ n. Note that deg F (x) ≤ 2k − 2 ≤ n − 2 < n.
ui = (αi − αj )−1 = m (αi ) , i = 1, . . . , n, where So we get f1 (x)xk−1 = f2 (x). Comparing the coefficients
1≤j≤n,j=i
m (x) is the first derivative of m(x). Then of xi , we have ai = 0, 1 ≤ i ≤ k − 1. Then, we obtain
⎛ ⎞ f1 (x) = a0 = 0. Hence, let λ = a0 , we get ti = λsi , for all
u1
g1
u2
g2 ··· un
gn 1 ≤ i ≤ n.
⎜ u1
α1
u2
α2 · · · un
gn αn
⎟ This completes our proof.
⎜ g1 g2 ⎟
H=⎜ .. .. .. ⎟ (7) In [15, Corollary 6], Jin proved that the dual code of a
⎝ . . . ⎠
GRS code is a GRS code by the theory of algebraic geometry.
u1 n−k−1
α
g1 1
u2 n−k−1
α
g2 2 · · · un n−k−1
α n
gn Analogously, we give the necessary and sufficient condition
is the parity check matrix of Gk (L, g). such that the dual codes of GRS codes via (expurgated) Goppa
codes are also GRS codes via Goppa codes.
Theorem 2.6: Let Gk (L, g) be the GRS code via the
B. Dual Codes of GRS Codes
Goppa code in Definition 2.3, deg(g(x)) = k, and
Given two vectors x = (x1 , x2 , . . . , xn ) and y = n
m(x) = (x − αi ). Then the dual code of Gk (L, g) is also
(y1 , y2 , . . . , yn ) ∈ Fnq , the Euclidean inner product is defined i=1
n
a GRS code via a Goppa code, i.e., G⊥
by x, yE = xi yi . For a linear code C of length n over k (L, g) = Gn−k (L, t),
i=1 deg(t(x)) = n − k, if and only if there exists λ ∈ F∗q such
Fq , the code that g(x)t(x) = m(x) + λ · m (x).
C ⊥ = {x ∈ Fnq | x, yE = 0, for all y ∈ C } Proof: Let Gn−k (L, t) be the GRS code via the Goppa
code in Definition 2.3, where t(x) is a monic polynomial of
is referred to as its Euclidean dual code. degree n−k over Fq . Then the generator matrix of Gn−k (L, t)
Lemma 2.5: Assume that n ≥ 2k and L = is in the following:
{α1 , α2 , . . . , αn } is a set of n distinct elements of Fq . ⎛ ⎞
If the GRS code C has two generator matrices as follows: t1 t2 ··· tn
⎛ ⎞ ⎛ ⎞ ⎜ t1 α1 t2 α2 ··· tn αn ⎟
⎜ ⎟
t1 t2 ··· tn β0 G = ⎜ .. .. .. ⎟,
⎜ t1 α1 ⎝ ⎠
⎜ t2 α2 · · · tn αn ⎟ ⎜
⎟ ⎜ β1 ⎟
⎟ . . .
A=⎜ .. .. .. ⎟  ⎜ .. ⎟ ,
n−k−1
t1 α1 n−k−1
t2 α2 · · · tn αnn−k−1
⎝ . . . ⎠ ⎝ . ⎠
ti = t(αi )−1 , 1 ≤ i ≤ n.
t1 αk−1
1 t2 αk−1
2 · · · tn αk−1
n βk−1
and By Lemma 2.4, the generator matrix of G⊥k (L, g) is H in (7).
⎛ ⎞ ⎛ ⎞ Hence, by Lemma 2.5 we conclude that G⊥ k (L, g) =
s1 s2 ··· sn γ0 Gn−k (L, t) if and only if there exists λ ∈ F∗q such that
⎜ s1 α1 s2 α2 ··· sn αn ⎟ ⎜ γ1 ⎟
⎜ ⎟ ⎜ ⎟ H = λG if and only if
B=⎜ .. .. .. ⎟⎜ .. ⎟,
⎝ . . . ⎠ ⎝ . ⎠ ui
λ · ti = , i.e., t(αi )g(αi ) = λ · m (αi ), 1 ≤ i ≤ n,
s1 αk−1
1 s2 αk−1
2 · · · sn αk−1
n γk−1 gi

Authorized licensed use limited to: University of the Phillippines Diliman. Downloaded on January 31,2024 at 04:58:08 UTC from IEEE Xplore. Restrictions apply.
6622 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 67, NO. 10, OCTOBER 2021

if and only if g(x)t(x) ≡ λ · m (x) mod m(x) if and only if Theorem 3.1: Let C = Gk (L, g) be the GRS code in
Theorem 2.6, deg(g(x)) = k, g(x)t(x) = m(x) + λ · m (x),
g(x)t(x) = m(x) + λ · m (x), λ ∈ F∗q . λ ∈ F∗q , and C ⊥ = G⊥k (L, g) = Gn−k (L, t). Then

Note that m(x) is a monic polynomial of degree n, g(x) is a 

Hull(C) = C C ⊥ = Gs (L, d)
monic polynomial of degree k, and t(x) is a monic polynomial
of degree n − k. is a GRS code via a Goppa code, where d(x) =
This completes the proof. gcd(g(x), t(x)) and s = deg(d(x)).
Theorem 2.7: Let Gk+1 (L, g) be the GRS code via the Proof: By Definition 2.3 and Theorem 2.6,
expurgated Goppa code in Definition 2.3, deg(g(x)) = k,
n 
n
ci
and m(x) = (x − αi ). Then the dual code of Gk+1 (L, g) C ⊥ = G⊥
k (L, g) = {c = (c1 , . . . , cn ) ∈ Fq | ≡0
n
i=1 x − αi
is a GRS code via a Goppa code, i.e., G⊥ k+1 (L, g) =
i=1

Gn−k−1 (L, t), deg t(x) = n − k − 1, if and only if there mod g(x)},
exists λ ∈ F∗q such that g(x)t(x) = λ · m (x). n
ci
C = G⊥
n−k (L, t) = {c = (c1 , . . . , cn ) ∈ Fq |
n
≡0
Proof: Let Gk+1 (L, g) be the GRS code via the expur-
i=1
x − αi
gated Goppa code and deg(g(x)) = k. Then Gk+1 (L, g) has
 in (4) and the parity check matrix mod t(x)}.
the generator matrix G
⎛ ⎞ Let l(x) = lcm(g(x), t(x)). Then
u1
g1
u2
g2 ··· un
gn
⎜ u1
g1 α1
u2
g2 α2 ··· u n
gn αn
⎟  
n
H =⎜ ⎜ .. .. ..
⎟
⎟, Hull(C) = C C ⊥ = {c = (c1 , . . . , cn ) ∈ Fnq |
ci
≡0
⎝ . . . ⎠ i=1
x − αi
u1 n−k−2
g1 α1
u2 n−k−2
g2 α2 ··· un n−k−2
gn αn mod l(x)} = Γ(L, l).

where gi  g(αi )−1 , m (x) is the first derivative of m(x), Let d(x) = gcd(g(x), t(x)), s = deg(d(x)), and d(x)l(x) =
ui = (αi − αj )−1 = m (α1
, i = 1, . . . , n. g(x)t(x) = m(x) + λm (x). Then by Definition 2.3 and
i)
1≤j≤n,j=i Theorem 2.6,
On the other hand, Gn−k−1 (L, t) is a GRS code via a Goppa
code, deg(t(x)) = n − k − 1, and it has a generator matrix: Hull(C) = Γ(L, l) = G⊥
n−s (L, l) = Gs (L, d)
⎛ ⎞
t1 t2 ··· tn is a GRS code via a Goppa code.
⎜ t1 α1 t2 α2 ··· tn αn ⎟ This completes the proof.
⎜ ⎟
G = ⎜ .. .. .. ⎟, Theorem 3.2: Let C = Gk+1 (L, g) be the GRS code in
⎝ . . . ⎠
Theorem 2.7, deg(g(x)) = k, deg(t(x)) = n − k − 1,
t1 αn−k−2 t2 αn−k−2 · · · tn αn−k−2
1 2 n g(x)t(x) = λ · m (x), λ ∈ F∗q , and C ⊥ = G⊥
k+1 (L, g) =
ti = t(αi )−1 , 1 ≤ i ≤ n. Gn−k−1 (L, t) a GRS code via a Goppa code. Then

Hence, by Lemma 2.5 we conclude that G⊥ k+1 (L, g) = Hull(C) = C C ⊥ = Gs (L, d)
 = λG , λ ∈ F∗ , if and only if
Gn−k−1 (L, t) if and only if H q
is a GRS code via a Goppa code, where
ui
= λti , i.e, g(αi )t(αi ) = λm (αi ), 1 ≤ i ≤ n, d(x) = gcd(g(x), t(x)) and s = deg(d(x)).
gi Proof: By Definition 2.3 and Theorem 2.7,
if and only if g(x)t(x) ≡ λm (x) mod m(x) if and only if 
n
ci
g(x)t(x) = λm (x), λ ∈ F∗q . C ⊥ = G⊥
k+1 (L, g) = {c = (c1 , . . . , cn ) ∈ Fq |
n
≡0
This completes the proof. i=1
x − αi

n
mod g(x), ci = 0},
III. H ULLS OF G OPPA C ODES i=1
In this section, we always assume that the dual codes of 
n
ci
C = G⊥
n−k−1 (L, t) = {c = (c1 , . . . , cn ) ∈ Fq |
n
≡0
GRS codes via (expurgated) Goppa codes are all GRS codes
i=1
x − αi
via Goppa codes. Let Fq be the finite field of order q, where
mod t(x)}.
q is a prime power. We study the hulls of the Goppa codes
under the condition above. Recall the definition of the hulls Let l(x) = lcm(g(x), t(x)). Then
of C as follows: 
Hull(C) = C C ⊥. 
n
ci
Hull(C) = {c = (c1 , . . . , cn ) ∈ Fnq | ≡0
i=1
x − αi
If Hull(C) = {0}, C is called an Euclidean LCD code; if

n
Hull(C) = C, C is call a self-orthogonal code; if Hull(C) = C, mod l(x), 
ci = 0} = Γ(L, l).
i.e., dim(C) = dim(C ⊥ ), C is called a self-dual code. i=1

Authorized licensed use limited to: University of the Phillippines Diliman. Downloaded on January 31,2024 at 04:58:08 UTC from IEEE Xplore. Restrictions apply.
GAO et al.: HULLS OF GRS CODES VIA GOPPA CODES AND THEIR APPLICATIONS TO QUANTUM CODES 6623

Let d(x) = gcd(g(x), t(x)), s = deg(d(x)), n − s − 1 = TABLE I

deg(l(x)), and d(x)l(x) = g(x)t(x) = λm (x). Then by S ELF -D UAL GRS C ODES OVER F9 FOR λ = 1
Definition 2.3 and Theorem 2.7,


Hull(C) = Γ(L, l) = G⊥
n−s (L, l) = Gs (L, d)

is a GRS code via a Goppa code.

This completes the proof.
Remark 3.3: It already has extensive research in hulls for
linear codes. The minimum distances of the hulls were pre-
sented explicitly for binary case in [8], but it is still unknown
for odd prime case. By Theorems 3.1 and 3.2, we know that Example 3.9: Let q = 32 , λ = 1, F∗q = γ and Gk (L, g)
Hull(C) are GRS codes with parameters [n, n − d, d + 1]. be the GRS code via the Goppa code. Self-dual GRS codes
The following results can be easily obtained by for deg g(x) ≤ 3 over Fq are as follows by Magma.
Theorem 3.1. (1) There are 9 self-dual GRS codes for deg g(x) = 1.
Corollary 3.4: The assumptions are as Theorem 3.1. (2) There doesnot exist self-dual GRS codes for
(1) If deg gcd(g(x), t(x)) = 1, then dim Hull(C) = 1. deg g(x) = 2.
(2) If deg gcd(g(x), t(x)) = 2, then dim Hull(C) = 2. (3) There are only 3 self-dual GRS codes for deg g(x) = 3.
Example 3.5: (1) Let q = 33 , λ = 1 and F∗q = γ. Then the For instance, we list all self-dual GRS codes for
following Goppa polynomials gi (x) are satisfy the requirement deg g(x) = 1 and deg g(x) = 3 in Table I.
dim Hull(C) = 1 of Corollary 3.4: Example 3.10: Let q = 52 , λ = 1, F∗q = ω and Gk (L, g)
i) g1 (x) = x + γ 5 ; be the GRS code via the Goppa code. Self-dual GRS codes
ii) g2 (x) = (x + γ 9 )(x + γ 17 ); for deg g(x) ≤ 3 over Fq are as follows by Magma.
iii) g3 (x) = (x + 1)(x + γ 15 )(x + γ 19 ); g4 (x) = (x + (1) There are 25 self-dual GRS codes for deg g(x) = 1.
γ )(x2 + γ 24 x + γ 7 ).
12
(2) There are 25 self-dual GRS codes for deg g(x) = 2.
(2) Let q = 52 , λ = 1 and F∗q = ω. Then the fol- (3) There doesnot exist self-dual GRS codes for
lowing Goppa polynomials gi (x) are satisfy the requirement deg g(x) = 3.
dim Hull(C) = 1 of Corollary 3.4: For instance, we list all self-dual GRS codes for
i) g1 (x) = x + 2; deg g(x) = 1 and deg g(x) = 2 in Table II.
ii) g2 (x) = (x + 1)(x + ω 21 ); The following results can be easily obtained by
iii) g3 (x) = (x + ω 9 )(x + 3)(x + ω 13 ), g4 (x) = (x + Theorem 3.2.
ω )(x2 + ω 22 x + ω 16 ).
16
Corollary 3.11: The assumptions are as Theorem 3.2.
Example 3.6: (1) Let q = 33 , λ = 1 and F∗q = γ. Then the (1) If deg gcd(g(x), t(x)) = 1, then dim Hull(C) = 1.
following Goppa polynomials gi (x) are satisfy the requirement (2) If deg gcd(g(x), t(x)) = 2, then dim Hull(C) = 2.
dim Hull(C) = 2 of Corollary 3.4: Example 3.12: (1) Let q = 33 , λ = 1 and F∗q = γ.
i) g1 (x) = x2 + γ 25 x + γ 12 , g2 (x) = x2 + γ 9 x + γ 10 ; Then the following Goppa polynomials gi (x) are satisfy the
ii) g3 (x) = (x + γ 14 )(x2 + γ 21 x + γ), g4 (x) = (x + γ 16 ) requirement dim Hull(C) = 1 of Corollary 3.11:
(x + γ 11 x + γ 3 );
2
i) g1 (x) = x + 2; ii) g2 (x) = (x + γ)2 ; iii) g3 (x) = (x +
iii) g5 (x) = (x2 + x + γ 11 )(x2 + γ 14 x + γ 16 ), g6 (x) = γ )(x + γ 19 )2 .
8

(x + γ 2 x + γ 23 )(x2 + γ 18 x + γ 3 ).
2
(2) Let q = 52 , λ = 1 and F∗q = ω. Then the fol-
(2) Let q = 52 , λ = 1 and F∗q = ω. Then the fol- lowing Goppa polynomials gi (x) are satisfy the requirement
lowing Goppa polynomials gi (x) are satisfy the requirement dim Hull(C) = 1 of Corollary 3.11:
dim Hull(C) = 2 of Corollary 3.4: i) g1 (x) = x + 1; ii) g2 (x) = (x + ω 10 )(x + ω 23 );
i) g1 (x) = (x + ω 17 )2 , g2 (x) = (x + ω 10 )2 ; iii) g3 (x) = (x + ω 20 )(x2 + ω 9 x + ω 13 ); iv) g4 (x) = (x +
ii) g3 (x) = (x + ω 9 )(x + 4)2 , g4 (x) = (x + ω 10 )(x + ω 15 )2 ω )(x3 + ω 7 x2 + ω 13 x + ω 2 ).
13

iii) g5 (x) = (x2 + 2x + ω 8 )(x2 + ω 16 x + ω), g6 (x) = Example 3.13: Let q = 72 , λ = 1 and F∗q = ω. Then the
(x + 3x + ω 16 )(x2 + ω 4 x + 3).
2
following Goppa polynomials gi (x) are satisfy the requirement
Theorem 3.7: The assumptions are as Theorem  3.1. dim Hull(C) = 2 of Corollary 3.11:
(1) If gcd(g(x), t(x)) = 1, then dim(C C ⊥ ) = 0. Hence, i) g1 (x) = (x + 2)(x + ω 37 ), g2 (x) = (x + ω 18 )(x + ω 46 );
Gk (L, g) is an LCD GRS code via a Goppa  code. ii) g3 (x) = (x + ω 9 )(x + ω 20 )(x + ω 34 ), g4 (x) = (x +
(2) If g(x) = t(x), then dim(C C ⊥ ) = n2 . Hence, ω )(x + ω 13 )(x + ω 21 ).
6

Gk (L, g) is a self-dual GRS code via a Goppa code. Theorem 3.14: The assumptions are as  Theorem 3.2.
Proof: The result follows immediately from (1) If gcd(g(x), t(x)) = 1, then dim(C C ⊥ ) = 0. Hence,
Theorem 3.1. Gk+1 (L, g) is an LCD GRS code via an expurgated Goppa
Remark 3.8: There are a lot of LCD GRS codes by adjust- code.
ing the factors of m(x) + λ · m (x) appropriately. So we omit (2) If and deg gcd(g(x), t(x)) = n2 − 1, then
 n⊥is even
them. dim(C C ) = 2 − 1. n

Authorized licensed use limited to: University of the Phillippines Diliman. Downloaded on January 31,2024 at 04:58:08 UTC from IEEE Xplore. Restrictions apply.
6624 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 67, NO. 10, OCTOBER 2021

TABLE II
S ELF -D UAL GRS C ODES OVER F25 FOR λ = 1

n
Proof: The result follows immediately from unitary operators. The set of error operators on Cq is defined
Theorem 3.2. as
ξn = {ζpi X(a)Y (b) : 0 ≤ i ≤ p − 1, where
IV. A PPLICATIONS TO EAQECCS
a = (a1 , a2 , . . . , an ), b = (b1 , b2 , . . . , bn ) ∈ Fnq },
Entanglement-assisted quantum error-correcting
codes (EAQECCs) make use of preexisting entanglement where ζp is a complex primitive p-th root of unity. The actions
n
between the sender and receiver to boost the rate of of X(a) and Y (b) on the basis | v ∈ Cq (v ∈ Fnq ) are
transmission. In this section, we recall some basic defined as
notions of entanglement-assisted quantum error-correcting
X(a)| v = | v + a and Y (b)| v = ζptr(v, b E)
| v,
codes (EAQECCs) and then construct two new families of
MDS EAQECCs by using the results in Section III. respectively, where tr(·) is the trace function from Fq to Fq .
Let C be the complex field and Cq be the q-dimensional The error set ξn forms a non-abelian group and has nice
Hilbert space over C. A qubit is just a non-zero vector of Cq . property. For any error E = ζpi X(a)Y (b), we define the
Let {| a : a ∈ Fq } be a basis of Cq , then a qubit | v can be quantum weight of E by
expressed as  wQ (E) = {i : (ai , bi ) = (0, 0)}.
| v = va | a,
a∈Fq Let ξn (l) = {E ∈ ξn : wQ (E) ≤ l} be the set of error
where va ∈ C. In general, an n-qubit is a joint state of n  operators with weight no more than l. A quantum code Q can
detect a quantum error E if and only if for any | u, | v ∈ Q
qubits in the q n -dimensional Hilbert space (Cq ) n ∼
n
= Cq .
Similarly, an n-qubit can be represented as with u| v = 0, we have u| E| v = 0. The quantum code Q
 has minimum distance d if d is the largest integer such that for
| v = va | a, any | u, | v ∈ Q with u| v = 0 and E ∈ ξn (d − l), u| E|
a∈Fn
q v = 0. We denote by ((n, K, d))q or [[n, k, d]]q a
  q-ary quantum code of length n, dimension K and minimum
where {| a = | a1  | a2  · · · | an  : (a1 , a2 , . . . , an ) ∈
n distance d, where k = logq K.
Fnq } is 
a basis of Cq and v a ∈ C. For any two n-qubits
|u = ua | a and | v = va | a, their Euclidean inner Brun et al. [5] investigated a new abelian subgroup in a
a∈Fn
q a∈Fn
q
larger error group and introduced the entanglement-assisted
product is defined as quantum error-correcting codes (EAQECCs), which is a
 generalization of quantum stabilizer codes. We usually use
u| v = va ua ∈ C. [[n, k, d; c]]q to denote a q-ary EAQECC that encodes k
a∈Fn
q
information qubits into n channel qubits with the help of c
A quantum code of length n is just defined as a subspace ebits (Details of the encoding procedure can be found in [30]),
n
of Cq . The quantum errors in a quantum system are some and d is called the minimum distance of the EAQECC. Such a

Authorized licensed use limited to: University of the Phillippines Diliman. Downloaded on January 31,2024 at 04:58:08 UTC from IEEE Xplore. Restrictions apply.
GAO et al.: HULLS OF GRS CODES VIA GOPPA CODES AND THEIR APPLICATIONS TO QUANTUM CODES 6625

TABLE III
S AMPLE PARAMETERS OF EAQECC S F25

quantum code can detect up to d − 1 and correct up to d−1 2 Remark 4.6: In [9] and [21], the authors provided several
quantum errors. constructions of MDS EAQECCs and the required number of
In [34], Wilde and Brun provided a method for constructing maximally entangled states can also take arbitrarily possible
EAQECCs by utilizing classical linear codes over finite fields values. But, they constructed several classes of GRS and
as follows. extended GRS codes under some limiting conditions for n
Lemma 4.1 [34]: Assume that H1 and H2 are parity and q. In our Theorem 4.5, we provide two classes of MDS
check matrices of two q-ary linear codes [n, k1 , d1 ] and EAQECCs with new and flexible parameters. In the following,
[n, k2 , d2 ] respectively. Then there exists an [[n, k1 + k2 − in order to illustrate our result obtained in Theorem 4.5, we list
n + c, min{d1 , d2 }; c]]q EAQECC, where c = rank(H1 H2t ) is some examples of q-ary MDS EAQECCs in Table III.
the required number of maximally entangled states.
In [11], Grassl gave the Singleton bound for an EAQECC V. C ONCLUSION
in the following lemma.
The main contributions of this paper are the following:
Lemma 4.2 [11]: For any [[n, k, d; c]]q EAQECC, it satis-
• A necessary and sufficient condition that that the
fies n + c − k ≥ 2(d − 1), if d ≤ n+2 2 , where 0 ≤ c ≤ n − 1. dual codes of GRS codes via (expurgated) Goppa codes
An EAQECC is called a MDS EAQECC if its parameters
are also GRS codes via Goppa codes was described (see
achieve the Singleton bound. Guenda et al. [12] provided the
Theorems 2.6, 2.7).
relation between the value of rank(H1 H2t ) and the dimension
• Under the above condition, the dimensions of hulls of
of the hull of a classical linear code.
GRS codes via Goppa codes were obtained (see Theorem 3.1).
Lemma 4.3 [12]: Let C be a q-ary linear codes with
And the hulls of GRS codes via Goppa codes are still GRS
[n, k, d]. Assume that H is a parity check matrix and G is
codes via (expurgated) Goppa codes (see Theorems 3.1, 3.2).
a generator matrix of C. Then we have
And some numerical examples, especially self-dual GRS
rank(HH t ) = n−k−dim(Hull(C)) = n−k−dim(Hull(C ⊥ )), codes, were presented to illustrate our main results
(see Examples 3.5, 3.6, 3.12, 3.13, Tables I, II).
and • Two new classes of MDS EAQECCs with flexible para-
rank(GGt ) = k − dim(Hull(C)) = k − dim(Hull(C ⊥ )). meters were constructed (see Theorem 4.5, Table III).

We immediately obtain the following result from ACKNOWLEDGMENT

Lemmas 4.1, 4.2 and 4.3.
Lemma 4.4 [12]: Let C be an [n, k, d] a linear codes over The authors are very grateful to the reviewers and the editor
Fq and C ⊥ its Euclidean dual with [n, n − k, d⊥ ]. Then there for their valuable suggestions that improved the quality of this
exist [[n, k − dim(Hull(C)), d; n − k − dim(Hull(C))]]q and article.
[[n, n−k−dim(Hull(C)), d⊥ ; k−dim(Hull(C))]]q EAQECCs.
Moreover, if C is MDS, then the two EAQECCs are also MDS. R EFERENCES
With the above lemma, the construction of MDS EAQECCs [1] S. V. Bezzateev and I. K. Noskov, “Patterson algorithm for decoding
turns into that of MDS linear codes with hulls of the deter- separable binary Goppa codes,” in Proc. Wave Electron. Appl. Inf.
Telecommun. Syst. (WECONF), Jun. 2019, pp. 1–5.
mined dimensions. In Section III, using MDS Goppa codes, [2] S. V. Bezzateev and N. A. Shekhunova, “Lower bounds on the covering
we presented a necessary and sufficient condition that the radius of the non-binary and binary irreducible Goppa codes,” IEEE
dual code of a GRS code via a Goppa code is also a GRS Trans. Inf. Theory, vol. 64, no. 11, pp. 7171–7177, Nov. 2018.
code via a Goppa code, and based on the condition, and [3] S. V. Bezzateev and N. A. Shekhunova, “Subclass of cyclic Goppa
codes,” IEEE Trans. Inf. Theory, vol. 59, no. 11, pp. 7379–7385,
we completely determined their hulls. By Lemma 4.4 and Nov. 2013.
Theorem 3.1, we have the following result directly. [4] S. V. Bezzateev and N. A. Shekhunova, “Chain of separable binary
Theorem 4.5 : Let C = Γ(L, g) be an [n, n − k, k + 1] Goppa codes and their minimal distance,” IEEE Trans. Inf. Theory,
vol. 54, no. 12, pp. 5773–5778, Dec. 2008.
MDS GRS code and C ⊥ = Γ⊥ (L, g) = Γ(L, t) its dual with [5] T. Brun, I. Devetak, and M.-H. Hsieh, “Correcting quantum errors with
[n, k, n − k + 1]. There exist [[n, n − k − s, k + 1; k − s]]q entanglement,” Science, vol. 314, no. 5798, pp. 436–439, Oct. 2006.
MDS EAQECCs and [[n, k − s, n − k + 1; n − k − s]]q MDS [6] B. Chen and H. Liu, “New constructions of MDS codes with comple-
mentary duals,” IEEE Trans. Inf. Theory, vol. 64, no. 8, pp. 5776–5782,
EAQECCs, where s = deg gcd(g(x), t(x)). Aug. 2018.

Authorized licensed use limited to: University of the Phillippines Diliman. Downloaded on January 31,2024 at 04:58:08 UTC from IEEE Xplore. Restrictions apply.
6626 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 67, NO. 10, OCTOBER 2021

[7] Y. Ding and X. Lu, “Galois hulls of cyclic codes over finite fields,” [31] M. Tomlinson, S. V. Bezzateev, M. Jibril, M. A. Ambroze, and
IEICE Trans. Fundamentals Electron., Commun. Comput. Sci., vol. 103, M. Z. Ahmed, “Using the structure of subfields in the construction
no. 1, pp. 370–375, 2020. of Goppa codes and extended Goppa codes,” IEEE Trans. Inf. Theory,
[8] Z. Du, C. Li, and S. Mesnager, “Constructions of self-orthogonal codes vol. 61, no. 6, pp. 3214–3224, Jun. 2015.
from hulls of BCH codes and their parameters,” IEEE Trans. Inf. Theory, [32] J. H. van Lint, Introduction to Coding Theory. New York, NY, USA:
vol. 66, no. 11, pp. 6774–6784, Nov. 2020. Springer-Verlag, 1982.
[9] W. Fang, F.-W. Fu, L. Li, and S. Zhu, “Euclidean and Hermitian hulls [33] L.-P. Wang, “Linearized Goppa codes,” in Proc. IEEE Int. Symp.
of MDS codes and their applications to EAQECCs,” IEEE Trans. Inf. Inf. Theory (ISIT), Jun. 2018, pp. 2496–2500, doi: 10.1109/ISIT.
Theory, vol. 66, no. 6, pp. 3527–3537, Jun. 2020. 2018.8437579.
[10] V. Goppa, “A new class of linear error correcting codes,” Probl. [34] M. M. Wilde and T. A. Brun, “Optimal entanglement formulas for
Peredachi Inf., vol. 6, no. 3, pp. 207–212, 1970. entanglement-assisted quantum coding,” Phys. Rev. A, Gen. Phys.,
[11] M. Grassl, “Entanglement-assisted quantum communication beating the vol. 77, no. 6, Jun. 2008, Art. no. 064302.
quantum Singleton bound,” presented at the 16th Asian Quantum Inf. [35] Y. Wu and Q. Yue, “Factorizations of binomial polynomials and enu-
Sci. Conf. (AQIS), Taipei, Taiwan, 2016. [Online]. Available: http://aqis- merations of LCD and self-dual constacyclic codes,” IEEE Trans. Inf.
conf.org/2016/program/ Theory, vol. 65, no. 3, pp. 1740–1751, Mar. 2019.
[12] K. Guenda, S. Jitman, and T. A. Gulliver, “Constructions of good
entanglement-assisted quantum error correcting codes,” Des., Codes
Cryptogr., vol. 86, no. 1, pp. 121–136, Jan. 2018.
[13] D. Huang, M. Shi, and P. Sole, “Double circulant self-dual and LCD
codes over Zp2 ,” Int. J. Found. Comput. Sci., vol. 30, no. 3, pp. 407–416, Yanyan Gao received the Ph.D. degree in mathematics from Southeast Uni-
2019. versity, Nanjing, China, in 2013. From September 2011 to September 2012,
[14] M. Jibril, S. V. Bezzateev, M. Tomlinson, M. Grassl, and M. Z. Ahmed, she was a Visiting Ph.D. Student with the Department of Mathematical and
“A generalized construction of extended Goppa codes,” IEEE Trans. Inf. Statistical Sciences, University of Alberta, Canada. Since January 2018, she
Theory, vol. 60, no. 9, pp. 5296–5303, Sep. 2014. has been a Post-Doctoral Fellow with the Nanjing University of Aeronautics
[15] L. Jin, “Construction of MDS codes with complementary duals,” IEEE and Astronautics, Nanjing. She is currently an Associate Professor with the
Trans. Inf. Theory, vol. 63, no. 5, pp. 2843–2847, May 2017. Department of Mathematics and Physics, Nanjing Institute of Technology,
[16] L. Jin and C. Xing, “New MDS self-dual codes from generalized Reed— Nanjing. Her research interests include algebraic structure of group algebras
Solomon codes,” IEEE Trans. Inf. Theory, vol. 63, no. 3, pp. 1434–1438, and coding theory.
Mar. 2017.
[17] F. Levy-dit-Vehel and S. Litsyn, “Parameters of Goppa codes revisited,”
IEEE Trans. Inf. Theory, vol. 43, no. 6, pp. 1811–1819, Nov. 1997.
[18] C. Li, C. Ding, and S. Li, “LCD cyclic codes over finite fields,” IEEE
Trans. Inf. Theory, vol. 63, no. 7, pp. 4344–4356, Jul. 2017. Qin Yue received the Ph.D. degree in mathematics from the University of
[19] J. Li and D. Wan, “On the subset sum problem over finite fields,” Finite Science and Technology of China, Hefei, China. He is currently a Professor
Fields Appl., vol. 14, no. 4, pp. 911–929, 2007. with the Department of Mathematics, Nanjing University of Aeronautics and
[20] H. Liu and X. Pan, “Galois hulls of linear codes over finite fields,” Des., Astronautics, Nanjing, China. His research interests include algebraic number
Codes Cryptogr., vol. 88, no. 2, pp. 241–255, Feb. 2020. theory, cryptography, and coding theory.
[21] G. Luo, X. Cao, and X. Chen, “MDS codes with hulls of arbitrary
dimensions and their quantum error correction,” IEEE Trans. Inf. Theory,
vol. 65, no. 5, pp. 2944–2952, May 2019.
[22] F. J. MacWilliams and N. J. A. Sloan, The Theory of Error-Correcting
Codes. Amsterdam, The Netherlands: North-Holland, 1978. Xinmei Huang received the B.S. and Ph.D. degrees in mathematics from
[23] J. L. Massey, “Linear codes with complementary duals,” Discrete Math., Yangzhou University, Yangzhou, China, in 2004 and 2009, respectively. From
vols. 106–107, pp. 337–342, Sep. 1992. June 2009 to September 2019, she was a Lecturer with the School of
[24] C. J. Moreno and O. Moreno, “Exponential sums and Goppa codes. I,” Science, Nanjing Forestry University, Nanjing, China. From August 2010 to
Proc. Amer. Math. Soc., vol. 111, no. 2, pp. 523–531, 1991. October 2014, she was a Research Fellow with the Temasek Laboratories,
[25] C. J. Moreno and O. Moreno, “Exponential sums and Goppa codes. II,” Nanyang Technological University, Singapore. She is currently a Lecturer with
IEEE Trans. Inf. Theory, vol. 38, no. 4, pp. 1222–1229, Jul. 1992. the Jinling Institute of Technology, Nanjing. Her research interests include
[26] N. Patterson, “The algebraic decoding of Goppa codes,” IEEE Trans. information theory and error-correcting codes.
Inf. Theory, vol. IT-21, no. 2, pp. 203–207, Mar. 1975.
[27] E. Sangwisut, S. Jitman, S. Ling, and P. Udomkavanich, “Hulls of cyclic
and negacyclic codes over finite fields,” Finite Fields Appl., vol. 33,
pp. 232–257, May 2015.
[28] M. Shi, D. Huang, L. Sok, and P. Solé, “Double circulant self-dual and Jun Zhang received the B.S. degree in mathematics and the Ph.D. degree
LCD codes over Galois rings,” Adv. Math. Commun., vol. 13, no. 1, from Nankai University, Tianjin, China, in 2008 and 2014, respectively.
pp. 171–183, 2019. Since August 2014, he has been with the School of Mathematical Sciences,
[29] X. Shi, Q. Yue, and S. Yang, “New LCD MDS codes constructed from Capital Normal University, Beijing, China, where he is currently an Associate
generalized Reed–Solomon codes,” J. Algebra Appl., vol. 18, no. 8, Professor. He visited the Department of Mathematics, University of California
Aug. 2019, Art. no. 1950150. at Irvine, USA, from September 2012 to September 2013. He visited the
[30] J. Shin, J. Heo, and T. A. Brun, “Entanglement-assisted codeword School of Computer Science, The University of Oklahoma, USA, from
stabilized quantum codes,” Phys. Rev. A, Gen. Phys., vol. 84, no. 6, January 2017 to December 2017. His research interests include number theory,
Dec. 2011, Art. no. 062321. coding theory, and cryptography.

Authorized licensed use limited to: University of the Phillippines Diliman. Downloaded on January 31,2024 at 04:58:08 UTC from IEEE Xplore. Restrictions apply.