🔢 mathematics

Projector additive group codes

This paper introduces projector additive group codes as a natural algebraic generalization of idempotent group codes, characterizing them as projective submodules of group algebras and establishing their duality properties, classification criteria, and structural relationships in both semisimple and non-semisimple cases.

Original authors: Javier de la Cruz

Published 2026-04-17

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Javier de la Cruz

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 a master architect designing a fortress to protect a kingdom. In the world of mathematics, this "kingdom" is a vast space of information (called a code), and the "fortress" is a set of rules that keeps that information safe from errors, like a digital noise storm.

For a long time, architects only built fortresses using Linear Codes. Think of these as fortresses built with a single, rigid type of brick. If you have a wall made of these bricks, you can only build new walls by stacking them in straight, predictable lines. This works great, but it limits what you can build.

Then, mathematicians discovered Additive Codes. These are like fortresses built with a mix of different materials—some bricks, some wood, some stone. They are more flexible and can form shapes that the rigid linear bricks never could. This is especially useful for building Quantum Fortresses (quantum error-correcting codes), which need to be incredibly robust.

However, there was a problem. The old blueprints (algebraic rules) were designed for the rigid linear bricks. When architects tried to apply those same rules to the flexible additive fortresses, the blueprints didn't quite fit. They were too restrictive and missed the bigger picture.

The New Blueprint: Projector Additive Group Codes

This paper, written by Javier de la Cruz, introduces a new, more flexible blueprint called Projector Additive Group Codes.

Here is the core idea using a simple analogy:

1. The "Shadow" vs. The "Spotlight"

In the old way of thinking (Linear Codes), mathematicians used Idempotents. Imagine an idempotent as a magical stamp. If you stamp a piece of paper, the stamp leaves a specific shape. If you stamp it again, it doesn't change anything; the shape is already there. This "stamp" creates a code by leaving a permanent mark.

But in the world of Additive Codes, the "stamp" isn't flexible enough. It can't capture all the interesting shapes you want to build.

The author proposes using Projectors instead. Think of a projector not as a stamp, but as a spotlight.

Imagine a dark room (the entire space of possible codes).
You have a spotlight (the projector).
When you shine the light on the room, it illuminates a specific shape (the code).
The rest of the room remains in the dark (the part of the space you ignore).

The key difference? A projector is an action. It takes the whole room and "projects" a specific part of it into the light. This action-based approach is much more powerful because it works perfectly with the flexible "additive" materials, whereas the "stamp" (idempotent) only worked with the rigid "linear" materials.

2. The "Mirror" (Duality)

In coding theory, there is a concept called Duality. Imagine you have a shape (your code). If you hold up a mirror to it, you see its "dual" shape.

LCD Codes (Linear Complementary Dual): These are shapes where the original and its mirror image don't overlap at all. They are perfectly distinct.
Self-Dual Codes: These are shapes where the original and the mirror image are exactly the same.

The paper shows how to use the "spotlight" (the projector) to create these special shapes. It introduces a "mirror" for the projector itself (called an adjoint). By adjusting the angle of the spotlight and its mirror, the author gives us a recipe to build:

Fortresses that are perfectly distinct from their shadows (LCD).
Fortresses that are their own shadows (Self-Dual).

3. The "Twin" Connection (Murray–von Neumann Equivalence)

Sometimes, two fortresses look different on the outside but are built with the exact same internal structure. In math, we call them "isomorphic."

The paper uses a concept called Murray–von Neumann equivalence. Think of this as a "Twin Test."

If you can take the blueprint of Fortress A, rearrange the furniture, and turn it into Fortress B without breaking anything, they are twins.
The author proves that if two "spotlights" (projectors) can be swapped around to create each other, then the fortresses they illuminate are structural twins. This helps mathematicians classify codes without having to build every single one.

Why Does This Matter?

Flexibility: This new framework allows mathematicians to study a much wider variety of codes than before. It's like upgrading from a 2D drawing to a 3D modeling tool.
Quantum Safety: Since these codes are crucial for Quantum Computing (which is very sensitive to errors), having better tools to design them means we can build more stable quantum computers.
Unification: It bridges the gap between the old, rigid world of linear codes and the new, flexible world of additive codes. It shows that the "projector" is the universal tool that works for both.

Summary

Javier de la Cruz is essentially saying: "Stop trying to force the flexible, additive codes into the rigid, old linear boxes. Instead, use a 'spotlight' (a projector) to define them. This new method is more natural, covers more cases, and gives us a clear way to build the perfect, error-proof fortresses needed for the future of computing."

1. Problem Statement and Motivation

The paper addresses a gap in the algebraic theory of additive group codes.

Context: An additive group code is defined as a left $FG$-submodule of the group algebra $KG$, where $F = \mathbb{F}_q$ is a finite field, $K = \mathbb{F}_{q^m}$ is a finite extension, and $G$ is a finite group. Unlike linear group codes (which are left ideals of $KG$), additive codes are only required to be linear over the subfield $F$ , not $K$ .
The Problem: In classical linear coding theory, group codes are often constructed using idempotent elements ( $e^2=e$ $e^{2} = e$ ) in $KG$, where the code is the image of the map $x \mapsto xe$ $x \mapsto x e$ . However, this construction fails to capture the full generality of additive group codes because:
1. Additive codes need not be $K$ -linear (ideals are always $K$ -linear).
2. Idempotent elements in $KG$ do not naturally generate all projective $FG$-submodules when $FG$ is not semisimple.
Goal: To establish a more general and natural algebraic framework for additive group codes by replacing idempotent elements with $FG$-linear projectors (idempotent endomorphisms of $KG$ as an $FG$-module).

2. Methodology

The author employs tools from module theory, representation theory of finite groups, and sesquilinear forms.

Framework: The study is conducted within the group algebra $KG$. The paper distinguishes between $K$ -linear codes (ideals) and $F$ -additive codes (submodules).
Forms: The analysis utilizes various inner products on $KG$:
- Euclidean ( $E$ ) and Trace-Euclidean ($TE$) forms.
- Hermitian ( $H$ ) and Trace-Hermitian ($TH$) forms (when $m$ is even).
- These forms are used to define duals, LCD (Linear Complementary Dual) codes, and self-dual codes.
Operator Approach: Instead of relying on ring elements (idempotents), the paper defines codes as the images of $FG$-linear projectors $P \in \text{End}_{FG}(KG)$ (where $P^2=P$ ).
Adjoint Operators: The paper introduces adjoint projectors ( $P^*$ ) with respect to the trace forms to characterize duality properties (LCD and self-duality).

3. Key Contributions and Definitions

A. Projector Additive Group Codes

The paper introduces two new classes of codes:

Projector Additive Left Group Codes: Defined as $C = \text{Im}(P)$ $C = Im (P)$ where $P$ $P$ is an $FG$-linear projector on $KG$.
- Theoretical Result: These codes coincide precisely with the projective left $FG$-submodules of $KG$.
- Semisimple Case: If $FG$ is semisimple (e.g., $\text{char}(F) \nmid |G|$ ), every additive left group code is a projector additive code.
- Non-Semisimple Case: The construction captures exactly the projective ones, which is a strict subset of all additive codes.
Restricted Projector Additive Codes: Defined as $P(N)$ where $N$ is a left $FG$-submodule. This generalizes the concept of "restricted idempotent codes" ($FGe$).

B. Duality and Adjoint Projectors

The paper establishes a direct link between the duality of codes and the adjointness of their defining projectors:

LCD Codes: An additive code $C = \text{Im}(P)$ is $\star$ -LCD (where $\star \in \{TE, TH\}$ ) if and only if there exists a projector $P$ such that $C = \text{Im}(P)$ and $P$ is self-adjoint ( $P^* = P$ ) with respect to the corresponding trace form.
Self-Dual Codes: $C$ is $\star$ -self-dual if there exists a projector $P$ such that $C = \text{Im}(P)$ and $P^* = I - P$ .

C. Murray–von Neumann Equivalence

The paper connects the isomorphism of additive group codes to the Murray–von Neumann equivalence of their defining projectors in the endomorphism ring $\text{End}_{FG}(KG)$ .

Two projector additive codes $\text{Im}(P)$ and $\text{Im}(Q)$ are isomorphic as left $FG$-modules if and only if $P$ and $Q$ are Murray–von Neumann equivalent (i.e., $P=BA$ and $Q=AB$ for some $A, B$ ).
This equivalence is preserved under taking adjoints, linking code isomorphism to the isomorphism of their duals.

D. Module Duals and Quotients

A significant structural result is the interpretation of quotients by orthogonal codes:

For an additive code $C$ , the quotient module $KG/C^{\perp_\star}$ is naturally isomorphic to the module dual $C^* = \text{Hom}_F(C, F)$ .
In terms of projectors, if $C = \text{Im}(P)$ , then $C^* \cong \text{Im}(P^*)$ .

4. Key Results and Theorems

Characterization of LCD Codes (Theorem 3.18):
$C$ is TE-LCD (or TH-LCD) iff $C = \text{Im}(P)$ for a self-adjoint projector $P$ .
- Application to Idempotents: The paper provides criteria (Theorem 3.22) for when a restricted idempotent code $FGe$ is LCD, involving the rank of a Gram matrix derived from the idempotent.
Characterization of Self-Dual Codes (Theorem 3.28):
A restricted idempotent code $FGe$ is $\star$ -self-dual if and only if:
1. The induced form on the quotient space is the zero form (i.e., $\langle xe, ye \rangle_\star = 0$ for all $x, y \in FG$ ).
2. $\dim_F(FGe) = \frac{1}{2} \dim_F(KG)$ .
- Example: The paper constructs a trace-Euclidean self-dual code using an idempotent in $\mathbb{F}_4 C_6$ , demonstrating that such codes exist even though Euclidean self-dual idempotent group codes (linear) do not.
Non-Existence of Certain Codes (Remark 3.29):
The paper proves that the Hexacode $H_6$ (a famous Hermitian self-dual code) is not an idempotent additive left group code, despite being an additive group code. This highlights the limitations of the idempotent approach even in the additive setting.

5. Significance

Generalization: The paper successfully generalizes the classical theory of idempotent group codes to the broader and more complex setting of additive codes. It resolves the issue that idempotents in $KG$ are insufficient to describe all additive structures.
Unification: It unifies the study of LCD and self-dual additive codes under the operator-theoretic framework of projectors and their adjoints.
Structural Insight: By linking code properties (LCD, self-duality) to the algebraic properties of projectors (self-adjointness, Murray–von Neumann equivalence), the paper provides powerful tools for constructing and classifying these codes.
Quantum Coding Relevance: Since additive codes over $\mathbb{F}_4$ and $\mathbb{F}_9$ are fundamental to quantum error correction, this algebraic framework offers new avenues for constructing quantum codes with specific duality properties (e.g., self-dual or LCD) that were previously difficult to characterize algebraically.

In summary, Javier de la Cruz shifts the paradigm from ring elements (idempotents) to module endomorphisms (projectors), providing a robust and complete algebraic characterization of additive group codes, their duals, and their structural properties.