An improved upper bound on self-dual codes over finite fields GF(11), GF(19), and GF(23)

DOI10.1007/S10623-021-00968-3MaRDI QIDQ2109392zbMATH OpenOpenAlexFDO

Authors Whan-Hyuk Choi, Jon-Lark Kim

Publication date 21 December 2022

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2102.08422

zbMATH Keywords

anti-orthogonal matrixoptimal codeself-dual codesymmetric generator matrixsymmetric self-dual code

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Abstract: This paper gives new methods of constructing {it symmetric self-dual codes} over a finite field $GF(q)$ where $q$ is a power of an odd prime. These methods are motivated by the well-known Pless symmetry codes and quadratic double circulant codes. Using these methods, we construct an amount of symmetric self-dual codes over $GF(11)$, $GF(19)$, and $GF(23)$ of every length less than 42. We also find 153 {it new} self-dual codes up to equivalence: they are $[32,16,12]$, $[36,18,13]$, and $[40,20,14]$ codes over $GF(11)$, $[36,18,14]$ and $[40,20,15]$ codes over $GF(19)$, and $[32,16,12]$, $[36,18,14]$, and $[40,20,15]$ codes over $GF(23)$. They all have new parameters with respect to self-dual codes. Consequently, we improve bounds on the highest minimum distance of self-dual codes, which have not been significantly updated for almost two decades.

Recommendations

• Self-Dual Linear Codes over $\mathbb{F}_{q}+u\mathbb{F}_{q}+u^2\mathbb{F}_{q}$ and Their Applications in the Study of Quasi-Abelian Codes
• On self-dual constacyclic codes over finite fields
• An improved upper bound on the minimum distance of doubly-even self-dual codes
• New asymptotic bounds for self-dual codes and lattices
• Self-dual codes over F₂ + u F₂ + v F₂ + uv F₂
• Self-dual codes better than the Gilbert-Varshamov bound
• A new upper bound on the minimal distance of self-dual codes
• On self-dual constacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
• Extremal self-dual codes over \(\mathbb{F}_2\times \mathbb{F}_2\)
• Self-dual codes over \(\mathbb{F}_2 \times (\mathbb{F}_2+v\mathbb{F}_2)\)

Cites work

• 2ⁿ bordered constructions of self-dual codes from group rings
• Almost MDS codes
• Codes and Siegel modular forms
• Explicit Constructions of MDS Self-Dual Codes
• Extremal quasi-cyclic self-dual codes over finite fields
• Fundamentals of Error-Correcting Codes
• scientific article; zbMATH DE number 1224949 (Why is no real title available?)
• New families of self-dual codes
• New MDS or Near-MDS Self-Dual Codes
• On circulant self-dual codes over small fields
• On self-dual codes over some prime fields.
• On sets of vectors of a finite vector space in which every subset of basis size is a basis
• Quadratic double circulant codes over fields
• Self-dual codes and orthogonal matrices over large finite fields
• Self-dual codes and the nonexistence of a quasi-symmetric 2-\((37,9,8)\) design with intersection numbers 1 and 3
• Symmetry codes and their invariant subcodes
• Symmetry codes over GF(3) and new five-designs
• The classification of self-dual modular codes
• Type II codes, even unimodular lattices, and invariant rings

Cited in

(4)

• On self-dual codes over some prime fields.
• Improved lower bounds for self-dual codes over \(\mathbb{F}_{11}\), \(\mathbb{F}_{13}\), \(\mathbb{F}_{17}\), \(\mathbb{F}_{19}\) and \(\mathbb{F}_{23}\)
• New results and bounds on codes over GF(19)
• The number of self-dual cyclic codes over finite fields

Describes a project that uses

Uses Software

• Magma

This page was built for publication: An improved upper bound on self-dual codes over finite fields \(\mathrm{GF}(11)\), \(\mathrm{GF}(19)\), and \(\mathrm{GF}(23)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2109392)