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
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7680980
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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; zbMATH DE number 7680980 |
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
0.8405694961547852
0 references
0.8349930644035339
0 references
0.8186853528022766
0 references
0.8153471946716309
0 references
0.8144817352294922
0 references
