An improved upper bound on self-dual codes over finite fields GF(11), GF(19), and GF(23)
From MaRDI portal
Publication:2109392
Abstract: This paper gives new methods of constructing {it symmetric self-dual codes} over a finite field where 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 , , and of every length less than 42. We also find 153 {it new} self-dual codes up to equivalence: they are , , and codes over , and codes over , and , , and codes over . 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
- 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
- Sphere packings, lattices and groups. With additional contributions by E. Bannai, R. E. Borcherds, J. Leech, S. P. Norton, A. M. Odlyzko, R. A. Parker, L. Queen and B. B. Venkov.
- 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)
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)