An improved upper bound on self-dual codes over finite fields \(\mathrm{GF}(11)\), \(\mathrm{GF}(19)\), and \(\mathrm{GF}(23)\)
From MaRDI portal
Publication:2109392
DOI10.1007/s10623-021-00968-3zbMath1506.94091arXiv2102.08422OpenAlexW3211707079MaRDI QIDQ2109392
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
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Uses Software
Cites Work
- Unnamed Item
- The classification of self-dual modular codes
- Almost MDS codes
- New families of self-dual codes
- On circulant self-dual codes over small fields
- Symmetry codes and their invariant subcodes
- Quadratic double circulant codes over fields
- Extremal quasi-cyclic self-dual codes over finite fields
- Self-dual codes and orthogonal matrices over large finite fields
- On self-dual codes over some prime fields.
- Codes and Siegel modular forms
- \(2^n\) bordered constructions of self-dual codes from group rings
- On sets of vectors of a finite vector space in which every subset of basis size is a basis
- Symmetry codes over GF(3) and new five-designs
- Fundamentals of Error-Correcting Codes
- New MDS or Near-MDS Self-Dual Codes
- Self‐Dual Codes and the Nonexistence of a Quasi‐Symmetric 2‐(37,9,8) Design with Intersection Numbers 1 and 3
- Type II codes, even unimodular lattices, and invariant rings
- Explicit Constructions of MDS Self-Dual Codes
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)\)