A recursive method for the construction and enumeration of self-orthogonal and self-dual codes over the quasi-Galois ring \(\mathbb{F}_{2^r}[u]/<u^e>\) (Q2701504)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A recursive method for the construction and enumeration of self-orthogonal and self-dual codes over the quasi-Galois ring \(\mathbb{F}_{2^r}[u]/<u^e>\) |
scientific article |
Statements
A recursive method for the construction and enumeration of self-orthogonal and self-dual codes over the quasi-Galois ring \(\mathbb{F}_{2^r}[u]/<u^e>\) (English)
0 references
28 April 2023
0 references
linear codes
0 references
Witt decomposition
0 references
classification algorithm
0 references
chain rings
0 references
0 references
0 references
