Constructing self-dual codes from group rings and reverse circulant matrices (Q2025380)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Constructing self-dual codes from group rings and reverse circulant matrices |
scientific article; zbMATH DE number 7347786
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructing self-dual codes from group rings and reverse circulant matrices |
scientific article; zbMATH DE number 7347786 |
Statements
Constructing self-dual codes from group rings and reverse circulant matrices (English)
0 references
12 May 2021
0 references
A self-dual code is a code which satisfies \(C=C^\perp.\) The authors give a construction for self-dual codes over rings of characteristic \(2\) using group rings and reverse circulant matrices. They apply it to rings that are equipped with a gray map to the binary space to construct binary self-dual codes. By applying extension and neighbor constructions along with this method, they construct \(3\) new codes of length \(64,\) \(22\) of length \(68,\) \(12\) of length \(80,\) and \(4\) of length \(92\).
0 references
group ring
0 references
extremal binary self-dual codes
0 references
codes over rings
0 references
reverse circulant matrices
0 references
0 references