🔢 mathematics

Dual of Algebraic Geometry codes from Hirzebruch surfaces

This paper provides an explicit form for algebraic geometry codes defined on Hirzebruch surfaces and their duals, establishing a lower bound for the dual's minimum distance, analyzing punctured variants, and constructing CSS quantum codes via sufficient conditions for orthogonal inclusions.

Original authors: Alix Barraud

Published 2026-03-23

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Alix Barraud

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to send a secret message across a noisy, stormy ocean. To make sure the message arrives intact, you don't just send the words; you add a lot of extra "check" letters. If a wave (an error) knocks some letters off course, the receiver can use the extra letters to figure out what was lost and fix it. This is the basic idea of error-correcting codes.

For decades, mathematicians have built these codes using curves (like circles or squiggly lines). But recently, they started trying to build them on surfaces (like sheets of paper or the skin of a balloon) to pack more information into the same space. This paper is about building these codes on a very specific, fancy type of surface called a Hirzebruch Surface.

Here is the breakdown of what the author, Alix Barraud, discovered, explained without the heavy math jargon.

1. The Playground: The Hirzebruch Surface

Think of a standard piece of graph paper. Now, imagine bending it and twisting it in a specific way so that it becomes a Hirzebruch Surface.

It's a mathematical shape that looks like a twisted cylinder or a cone.
It has two main directions you can draw lines on: "vertical" lines (fibers) and "horizontal" lines (sections).
The author uses this shape as a grid to place her "check points" (the locations where she evaluates her code).

2. The Code: Writing on the Grid

The author creates a code called $C_e(a, b)$ .

The Ingredients: She picks two numbers, $a$ and $b$ . These act like a recipe. They tell her which "shapes" (mathematical functions) she is allowed to write on the surface.
The Process: She writes these shapes down at every possible point on the grid. The resulting list of numbers is the codeword.
The Goal: If someone messes up a few numbers in the list, the structure of the shapes allows the receiver to reconstruct the original message.

3. The Big Problem: The "Shadow" (The Dual Code)

In the world of codes, every code has a twin called the Dual Code.

Analogy: Imagine your code is a lock. The dual code is the key. To build advanced security systems (like Quantum Computers), you need to know exactly what the key looks like.
The Difficulty: On simple curves, finding the key is easy. But on these twisted surfaces, the key is usually a mess. It's often not even a "code" in the traditional sense; it's a chaotic mix of different things.
The Author's Breakthrough: Alix Barraud figured out exactly what this "key" (the dual code) looks like. She didn't just guess; she wrote down a precise recipe for it. She showed that the dual code is actually a sum of two simpler codes. It's like realizing a complex puzzle is just two smaller, easier puzzles glued together.

4. The "Puncturing" Trick

To solve the puzzle, she used a clever trick called puncturing.

The Metaphor: Imagine your code is a giant quilt. Some parts of the quilt (the edges) are messy and hard to analyze. So, she cuts those edges off.
The Result: She removed the "points at infinity" (the edges of the surface) and looked at the code on the remaining flat square ( $q \times q$ ).
Why it worked: On this flat square, the code behaves much more predictably. She could easily find the "key" for this smaller code. Then, she used that knowledge to reconstruct the "key" for the original, giant quilt.

5. The Ultimate Goal: Quantum Security

Why do we care about finding the key?

Quantum Computers: The future of computing relies on Quantum Codes (specifically CSS codes). These are special codes that protect quantum data.
The Requirement: To build a good Quantum Code, you need a pair of codes where one fits inside the other, and you need to know their "keys" (duals) perfectly.
The Application: Because Alix now knows exactly what the dual code looks like, she can pair these surface codes together to build Quantum Error-Correcting Codes. These are the safety nets that will keep quantum computers from crashing when the universe gets a little too "noisy."

Summary of the "Magic"

The Surface: She chose a specific, twisted mathematical shape (Hirzebruch Surface) to write her codes on.
The Recipe: She defined a code based on two numbers ( $a$ and $b$ ).
The Mystery: She solved the mystery of the Dual Code (the "key"), which was previously a chaotic mess on these surfaces.
The Method: She cut off the messy edges of the shape, solved the puzzle on the clean center, and then put the edges back on to solve the whole thing.
The Payoff: She used this new knowledge to build better Quantum Codes, which are essential for the future of secure computing.

In short, this paper takes a very complex, high-level mathematical shape, figures out how to "unlock" its hidden security properties, and uses that to build a stronger foundation for the computers of tomorrow.

1. Problem Statement

Algebraic Geometry (AG) codes, originally constructed on curves by Goppa, have been generalized to higher-dimensional varieties, including algebraic surfaces. However, the theory for surfaces lags significantly behind that of curves due to two main challenges:

Complexity of Parameters: Computing the dimension and minimum distance for codes on surfaces is difficult because the Riemann–Roch theorem is more complex, and the difference between the number of points and divisors makes bounding the minimum distance hard.
Duality Issues: On curves, the dual of an AG code is often another AG code (via differential forms), allowing for explicit descriptions and easy estimation of dual distances. On surfaces, the dual of an AG code is generally not an AG code; it is a sum of AG codes. Consequently, explicit forms for duals and their minimum distances (dual distances) are largely unknown for most surface families.

This paper addresses these gaps by focusing on Hirzebruch surfaces ( $H_e$ ), a specific family of rational ruled surfaces. The primary goal is to provide an explicit form for the dual code $C_e(a, b)^\perp$ of the AG code $C_e(a, b)$ defined on $H_e$ , and to compute its dual minimum distance.

2. Methodology

The author employs a combination of algebraic geometry, combinatorics, and coding theory techniques:

Geometric Setup: The paper utilizes the structure of the Hirzebruch surface $H_e$ , generated by a section $S_e$ and a fiber $F_e$ . The Picard group is generated by these divisors. The AG code $C_e(a, b)$ is defined by evaluating functions in the Riemann–Roch space $L(aS_e + bF_e)$ at all $\mathbb{F}_q$ -rational points of $H_e$ .
Explicit Representation via Tensor Products:
- The author derives a new explicit form for the code $C_e(a, b)$ by decomposing the Riemann–Roch space into a sum of tensor products of Projective Reed–Solomon (PRS) codes.
- Specifically, $C_e(a, b)$ is expressed as a direct sum of terms involving $\langle (0^{d_1}, \alpha^{a-d_1}) \rangle \otimes PRS_q(\dots)$ .
Puncturing Strategy:
- To handle the duality, the author first studies a punctured code $C_{A,e}(a, b)$ , obtained by removing the points at infinity (the first row and column of the evaluation grid, corresponding to $S_e \cup F_e$ ).
- This punctured code corresponds to the affine plane $\mathbb{A}^2$ and allows for cleaner inclusion properties between codes.
Check-Product and Dual Distance:
- The concept of the check-product ( $E \boxplus F$ ) is used to describe the dual of tensor products.
- The author analyzes the minimum weight codewords in these check-products to determine the dual distance.
Orthogonal Inclusions:
- The paper constructs pairs of orthogonal codes by utilizing the "moving lemma" to find divisors that avoid rational points, ensuring the existence of inclusions $C_1 \subset C_2^\perp$ .

3. Key Contributions

A. Explicit Form of the Dual Code

The paper provides the first explicit description of the dual code $C_e(a, b)^\perp$ for Hirzebruch surfaces.

Theorem 4.2: The dual is expressed as the sum of three specific codes:
$C_e(a, b)^\perp = C_1 + C_2 + C_3$
Where $C_1$ and $C_2$ are related to punctured codes and tensor products of PRS codes, and $C_3$ is a specific subspace generated by vectors $v_d$ constructed to annihilate the original code.
Corollary 4.3: The dual is further characterized as the sum of two AG codes on $H_e$ with specific parameters, confirming that while the dual is not a single AG code, it is a finite sum of them.

B. Computation of Dual Minimum Distance

A major result is the exact computation of the dual minimum distance $d_e(a, b)^\perp$ .

Theorem 2.17: Under standard constraints ( $1 \le a \le q-1$ and $0 \le b-ea \le q-1$ ), the dual distance is:
$d_e(a, b)^\perp = \min\{a, b - ea\} + 2$
This result is derived by analyzing the punctured code and lifting the result back to the full surface, proving that the minimum weight codewords in the dual correspond to specific geometric configurations (lines or sections).

C. Construction of CSS Quantum Codes

Using the explicit duals and the constructed orthogonal pairs, the paper constructs Calderbank-Shor-Steane (CSS) quantum codes.

Theorem 6.2 & 6.3: The author constructs quantum codes $(C_1, C_2)_{CSS}$ where $C_1 \subset C_2$ . The parameters (length, dimension, and distance) are explicitly calculated.
Orthogonal Construction: Theorem 6.6 presents a method to build quantum codes using pairs of orthogonal codes $C_1 \subset C_2^\perp$ , providing a new family of quantum codes based on Hirzebruch surfaces.

4. Key Results

Dual Distance Formula: The paper establishes that the dual distance is linearly related to the parameters $a$ and $b-ea$, specifically $\min\{a, b-ea\} + 2$ .
Dimension Formulas: New explicit formulas for the dimension of both the original code $C_e(a, b)$ and its punctured version $C_{A,e}(a, b)$ are provided, refining previous work by Nardi.
Inclusion Conditions: The paper identifies precise conditions (Theorem 5.10) under which one AG code on $H_e$ is contained in another (or its dual), a prerequisite for constructing CSS codes.
Quantum Code Parameters: The paper provides concrete parameters for CSS codes derived from these surfaces. However, it notes a limitation: the dual distance is generally small (bounded by $q+1$ ), which is negligible compared to the code length $(q+1)^2$ . This suggests these codes are better suited for decoding applications than for high-distance quantum error correction, though degenerate cases might offer improvements.

5. Significance

Advancing Surface Codes: This work moves beyond the generic bounds for AG codes on surfaces by providing exact parameters for a specific, important family (Hirzebruch surfaces). It bridges the gap between the well-understood curve case and the complex surface case.
Solving the Duality Problem: By explicitly describing the dual as a sum of AG codes and calculating its minimum distance, the paper resolves a long-standing difficulty in the theory of AG codes on surfaces.
Quantum Applications: The construction of CSS codes from these surfaces expands the library of available quantum codes. While the dual distance is a limiting factor, the ability to explicitly construct orthogonal pairs allows for the systematic generation of quantum codes, which is a critical step in quantum error correction research.
Methodological Framework: The approach of using puncturing to simplify the geometry (moving from the projective surface to the affine plane) and then lifting results back provides a robust template for studying other families of algebraic surfaces.

In summary, Alix Barraud's paper provides a comprehensive and explicit theory for the duality of AG codes on Hirzebruch surfaces, offering precise formulas for dual distances and enabling the construction of new families of quantum codes.