<figure><img src="image_1.png" /></figure>

HAL
open science

Mathematical coding theory and its applications

Patrick Solé

► To cite this version:

Patrick Solé. Mathematical coding theory and its applications. AIMS Mathematics, 2024, 9, pp.5686 - 5687. 10.3934/math.2024275. hal-04512980

HAL Id: hal-04512980

https://hal.science/hal-04512980v1

Submitted on 20 Mar 2024

HAL is a multi-disciplinary open access
archive for the deposit and dissemination of sci-
entific research documents, whether they are pub-
lished or not. The documents may come from
teaching and research institutions in France or
abroad, or from public or private research centers.

L'archive ouverte pluridisciplinaire HAL, est
destinée au dépôt et à la diffusion de documents
scientifiques de niveau recherche, publiés ou non,
émanant des établissements d'enseignement et de
recherche français ou étrangers, des laboratoires
publics ou privés.

<figure><img src="image_2.png" /></figure>

Distributed under a Creative Commons CC BY 4.0 - Attribution - International License
<figure><img src="image_3.png" /></figure>

## Editorial

# Mathematical coding theory and its applications

Patrick Solé*

I2M, (CNRS, University of Aix-Marseille, Centrale Marseille), Marseilles, France

* Correspondence: Email: patrick.sole@telecom-paris.fr.

This special issue collects 8 papers on "Mathematical Coding Theory and its Applications". Coding theory is noteworthy for requiring many techniques from commutative algebra (ring theory especially), geometry of numbers, and generally discrete mathematics. The themes present in this issue are

* codes over rings (non-commutative, non-unitary, others);

* codes for alternative metrics (Lee, Euclidean);

* codes as ideals in special rings (polynomial and skew-polynomial rings).

The lion's share (5 papers) studies codes over rings. Two of these tackle codes over non-unitary rings (one is dedicated to mass formulas, and the other a construction from 3-class association schemes). A very interesting non-commutative ring is the ring of two by two matrices over finite fields (M2(F2)). A very complex polynomial ring yields quantum codes. The ring of integers modulo prime powers leads to codes for the Lee and Euclidean distance.

Codes over fields are considered by two papers one on finite fields (LCD code) and the other on number fields (BCH codes). One paper is studying frequency-hopping sequences over finite fields.

## Guest Editor:

Professor Patrick Solé, I2M, (CNRS, University of Aix-Marseille, Centrale Marseille), Marseilles, France

Email: patrick.sole@telecom-paris.fr.
Conflict of interest

The author declares no conflict of interest.

<figure><img src="image_4.png" /></figure>

AIMS Press

©2024 the Author(s), licensee AIMS Press. This
is an open access article distributed under the
terms of the Creative Commons Attribution License
(http://creativecommons.org/licenses/by/4.0)