On some minimal linear codes invariant under the Chevalley group $$\textrm{F}_4(2)$$

Abstract Minimal linear codes play a central role in applications such as secret sharing and secure communication, and their construction often reveals deep connections between coding theory and other areas of mathematics. Using a representation theoretic approach we construct six new minimal binary linear codes. Our approach exploits the action of the adjoint Chevalley group $$F_4(2)$$ on its natural 26-dimensional module, yielding codes of very large length, small dimension, and large minimum distance. The resulting codes are projective, divisible, and invariant under $$F_4(2)$$ acting transitively on coordinates. We provide a geometric description of minimum weight codewords and show that their stabilizers are maximal or second maximal subgroups of $$F_4(2)$$ . Furthermore, we demonstrate that these codes provide examples of both narrow and wide minimal codes. Our work links the structure of an exceptional finite group to the construction of highly symmetric minimal codes, thereby enriching the interplay between group theory and coding theory.

Authors

Institutions

Publication Details

Journal
Cryptography and Communications
Published
2026-06-13
DOI
https://doi.org/10.1007/s12095-026-00901-2
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On some minimal linear codes invariant under the Chevalley group $$\textrm{F}_4(2)$$

B. G. Rodrigues, A. Saeidi
Cryptography and Communications
Coding theory and cryptography
article

On some minimal linear codes invariant under the Chevalley group $$\textrm{F}_4(2)$$

B. G. Rodrigues, A. Saeidi
article en

Abstract

Abstract Minimal linear codes play a central role in applications such as secret sharing and secure communication, and their construction often reveals deep connections between coding theory and other areas of mathematics. Using a representation theoretic approach we construct six new minimal binary linear codes. Our approach exploits the action of the adjoint Chevalley group $$F_4(2)$$ on its natural 26-dimensional module, yielding codes of very large length, small dimension, and large minimum distance. The resulting codes are projective, divisible, and invariant under $$F_4(2)$$ acting transitively on coordinates. We provide a geometric description of minimum weight codewords and show that their stabilizers are maximal or second maximal subgroups of $$F_4(2)$$ . Furthermore, we demonstrate that these codes provide examples of both narrow and wide minimal codes. Our work links the structure of an exceptional finite group to the construction of highly symmetric minimal codes, thereby enriching the interplay between group theory and coding theory.

Cryptography and Communications
University of Pretoria (ZA), University of Limpopo (ZA)
Openalex Percentile: Top 3%
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.