2024/11/10 23:54 Algebraic-geometry codes | Error Correction Zoo

Here is a list of algebraic-geometry codes constructed using algebraic curves.

Code Description
Algebraic-geometry (AG) Binary or q-ary code or subcode constructed from an algebraic curve of some genus over
code a finite field via the evaluation construction, the residue construction, or more general
constructions that yield nonlinear codes. Linear AG codes from the first two
constructions are also called geometric Goppa codes.
Cartier code A generalization of the Goppa codes to codes defined from curves of non-zero genus.
Each code is a subcode of a certain residue AG code and is constructed using the Cartier
operator.
Elliptic code Evaluation AG code of rational functions evaluated on points lying on an elliptic curve,
i.e., a curve of genus one.
Evaluation AG code Evaluation code over GF (q) on a set of points P = (P , P , ⋯ , P ) in GF (q) lying
1 2 n

on an algebraic curve X whose corresponding vector space L of functions f consists of

certain polynomials or rational functions.
Extended GRS code A GRS code with an additional parity-check coordinate with corresponding evaluation
point of zero. In other words, an [n + 1, k, n − k + 2] GRS code whose polynomials
q

are evaluated at the points (α , ⋯ , α , 0). The case when n = q − 1, multipliers

1 n

v = 1, and α are i − 1st powers of a primitive nth root of unity is an extended

i i

narrow-sense RS code.
Generalized RS (GRS) An [n, k, n − k + 1] linear code that is a modification of the RS code where codeword
q

code polynomials are multiplied by additional prefactors.

Goppa code Let G(x) be a polynomial describing a projective-plane curve with coefficients from
) for some fixed integer m. Let L be a finite subset of the extension field
m
GF (q

) where q is prime, meaning L = {α , ⋯ , α } is a subset of nonzero

m
GF (q 1 n

elements of GF (q ). A Goppa code Γ(L, G) is an [n, k, d] linear code consisting of

m
q

all vectors a = a , ⋯ , a such that R (x) = 0 modulo G(x), where

1 n a

R (x) = ∑
a
n

i=1
. ai

z−α i

Hermitian code Evaluation AG code of rational functions evaluated on points lying on a Hermitian curve
in either affine or projective space. Hermitian codes improve over RS codes in length:
that RS codes have length at most q + 1 while Hermitian codes have length q + 1. 3

Hexacode The [6, 3, 4] self-dual MDS code that has connections to projective geometry, lattices [1]
4

, and conformal field theory [2]. Puncturing the code yields the perfect [5, 3, 3] 4

quaternary Hamming code known as the shortened hexacode or shorter hexacode [3].
Both codes are sometimes refereed to as Golay codes over GF (4).
Klein-quartic code Evaluation AG code over GF (8) of rational functions evaluated on points lying on the
Klein quartic, which is defined by the equation x y + y z + z x = 0 ([4], Ex. 2.75).
3 3 3

Narrow-sense RS code An [q − 1, k, n − k + 1] RS code whose points α are all (i − 1)st powers of a

q i

primitive element α of GF (q).

https://errorcorrectionzoo.org/list/ag 1/3
2024/11/10 23:54 Algebraic-geometry codes | Error Correction Zoo

Code Description
Nonlinear AG code Nonlinear q-ary code constructed by evaluating functions on an algebraic curve.
Norm-trace code Evaluation AG code of rational functions evaluated on points lying on a Miura-Kamiya
curve in either affine or projective space. The family is named as such because the
equations defining the curves can be expressed in terms of the field norm and field trace.
Plane-curve code Evaluation AG code of bivariate polynomials of some finite maximum degree, evaluated
at points lying on an affine or projective plane curve.
Primitive narrow-sense BCH codes for b = 1 and for n = q r
for some r ≥ 2.
BCH code
− 1

Reed-Solomon (RS) code An [n, k, n − k + 1] linear code based on polynomials over GF (q).
q

Residue AG code Linear q-ary code defined using a set of points P = (P , P , ⋯ , P ) in GF (q) lying
1 2 n

on an algebraic curve X and a linear space Ω of certain rational differential forms ω.

Single parity-check (SPC) An [n, n − 1, 2] linear binary code whose codewords consist of the message string
code appended with a parity-check bit or parity bit such that the parity (i.e., sum over all
coordinates of each codeword) is zero. If the Hamming weight of a message is odd
(even), then the parity bit is one (zero). This code requires only one extra bit of overhead
and is therefore inexpensive. Its codewords are all even-weight binary strings. Its
automorphism group is S . n

Srivastava code A special case of a generalized Srivastava code for z j = α

μ

j
for some μ and t = 1.
Suzuki-curve code Evaluation AG code of rational functions evaluated on points lying on a Suzuki curve.
Tamo-Barg code A family of q-ary polynomial evaluation codes that are optimal LRCs and for which q is
comparable to n.
Tamo-Barg-Vladut code Polynomial evaluation code on algebraic curves, such as Hermitian or Garcia-
Stichtenoth curves, that is constructed to be an LRC. Codes can be constructed to be be
able to recover locally after one or more erasures as well as to tackle the availability
problem.
Tetracode The [4, 2, 3] self-dual MDS code that has connections to lattices [1].
3

Tsfasman-Vladut-Zink Member of a family of residue AG or, more generally, evaluation AG codes where X is
(TVZ) code either Drinfeld modular curve, a classic modular curve, or a Garcia-Stichtenoth curve.
[2
r
− 1, 2
r
− r − 1, 3] Member of an infinite family of perfect linear codes with parameters
Hamming code [2 − 1, 2 − r − 1, 3] for r ≥ 2. Their r × (2 − 1) parity-check matrix H has all
r r r

possible non-zero r-bit strings as its columns. Adding a parity check yields the
[2 , 2 − r − 1, 4] extended Hamming code.
r r

[7, 4, 3] Hamming code Second-smallest member of the Hamming code family.

q -ary parity-check code An [n, n − 1, 2] linear q-ary code whose codewords consist of the message string
q

appended with a parity-check or zero-sum check digit such that the sum over all
coordinates of each codeword is zero.

References

https://errorcorrectionzoo.org/list/ag 2/3
2024/11/10 23:54 Algebraic-geometry codes | Error Correction Zoo
[1] J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups (Springer New York, 1999) DOI
[2] J. A. Harvey and G. W. Moore, “Moonshine, superconformal symmetry, and quantum error correction”, Journal of High
Energy Physics 2020, (2020) arXiv:2003.13700 DOI
[3] G. Hoehn, “Self-dual Codes over the Kleinian Four Group”, (2000) arXiv:math/0005266
[4] T. Høholdt, J.H. Van Lint, and R. Pellikaan, 1998. Algebraic geometry codes. Handbook of coding theory, 1 (Part 1), pp.871-
961.

Home, Code graph, Code lists, Concepts glossary, Search

Classical Domain
Binary Kingdom, Galois-field Kingdom, Matrix Kingdom, Analog Kingdom, Spherical Kingdom,
Ring Kingdom, Group Kingdom
Quantum Domain
Qubit Kingdom, Modular-qudit Kingdom, Galois-qudit Kingdom, Bosonic Kingdom, Spin Kingdom,
Group Kingdom, Category Kingdom
Classical-quantum Domain
Binary c-q Kingdom, Bosonic/analog c-q Kingdom
Add new code, Team, About
🌒

Error correction zoo by Victor V. Albert, Philippe Faist, and many contributors. This work is licensed under a CC-BY-SA License. See how to
contribute.

https://errorcorrectionzoo.org/list/ag 3/3