Algebraic geometric code: Article and Information about Algebraic geometric code

Algebraic geometric code - Fuhz Articles
Visually Impaired Edition.

Algebraic geometric code article, this Fuhz page will hopefully provide the answers to the who, what where and why on the Algebraic geometric code topic.
At the bottom of the page we often provide links to external documents relating to Algebraic geometric code which may also help your research. Every effort is made to ensure the content on this page is as accurate and error free as possible, however whenever researching information that requires the utmost accuracy such as a term paper it is always best to cross reference facts with numerous sources.

This article may be confusing or unclear to readers. Please help clarify the article; suggestions may be found on the talk page. (February 2009)

This article includes a list of references, related reading or external links, but its sources remain unclear because it lacks inline citations. Please improve this article by introducing more precise citations where appropriate. (April 2009)

In mathematics, an algebraic geometric code (AG-code), otherwise known as a Goppa code, is a general type of linear code constructed by using an algebraic curve $X$ over a finite field $\mathbb{F}_q$ . Such codes were introduced by Valerii Denisovich Goppa. In particular cases, they can have interesting extremal properties. They should not be confused with binary Goppa codes that are used, for instance, in the McEliece cryptosystem.

Traditionally, an AG-code can be constructed from a non-singular projective curve X over a finite field $\mathbb{F}_q$ by using a number of fixed distinct $\mathbb{F}_q$ -rational points

$\mathcal{P}$ := {P₁, P₂, ..., P_n} ⊂ X ( $\mathbb{F}_q$ ) on X.

Let G be a divisor on X, with a support that consists of only rational points and that is disjoint from the $P i$ 's. Thus $\mathcal{P}$ ∩ supp(G) = Ø
By the Riemann-Roch theorem, there is a unique finite-dimensional vector space, $L (G)$ , with respect to the divisor G. The vector space is a subspace of the function field of X.

There are two main types of AG-codes that can be constructed using the above information.

1 Function Code
2 Residue Code
3 References
4 External links

Function Code

The function code (or dual code) with respect to a curve X, a divisor G and the set $\mathcal{P}$ is constructed as follows.
Let $D = P_1 + P_2 + \cdots + P_n$ , be a divisor, with the $P i$ defined as above. We usually denote a Goppa code by C(D,G). We now know all we need to define the Goppa code:

C(D,G) = {(f(P₁), ..., f(P_n))|f $\in$ L(G)}⊂ $\mathbb{F}_q^n$

For a fixed basis

f₁, f₂, ..., f_k

for L(G) over $\mathbb{F}_q$ , the corresponding Goppa code in $\mathbb{F}_q^n$ is spanned over $\mathbb{F}_q$ by the vectors

(f_i(P₁), f_i(P₂), ..., f_i(P_n)).

Therefore

$\begin{bmatrix} f_1(P_1) & ... & f_1(P_n) \\ ... & ... & ... \\ f_k(P_1) & ... & f_k(P_n) \end{bmatrix}$

is a generator matrix for C(D,G)

Equivalently, it is defined as the image of

$\alpha : L(G) \longrightarrow \mathbb{F}^n$ ,

where f is defined by $f \longmapsto (f(P_1), \dots ,f(P_n))$ .

The following shows how the parameters of the code relate to classical parameters of linear systems of divisors D on C (cf. Riemann–Roch theorem for more). The notation l(D) means the dimension of L(D).

Proposition A The dimension of the Goppa code C(D,G) is

k = l (G) - l (G - D)

Proposition B The minimal distance between two code words is

$d \geq n - \deg(G)$ .

Proof A

Since

$C(D,G) \cong L(G)/\ker(\alpha),$

we must show that

$\ker(\alpha)=L(G-D)$ .

Suppose $f \in \ker(\alpha)$ . Then $f(P_i)=0, i=1, \dots ,n$ , so $div(f) > D$ . Thus, $f \in L(G-D)$ .
Conversely, suppose $f \in L(G-D)$ .
Then

div(f) > D

since

$P_i < G, i=1, \dots ,n$ .

(G doesn't “fix” the problems with the $- D$ , so f must do that instead.) It follows that

$f(P_i)=0, i=1, \dots ,n$ .

Proof B
To show that $d \geq n - \deg(G)$ , suppose the Hamming weight of $α(f)$ is d. That means that $f (P i) = 0$ for $n - d$ $P i$ s, say $P_{i_1}, \dots ,P_{i_{n-d}}$ . Then $f \in L(G-P_{i_1} - \dots - P_{i_{n-d}})$ , and