New lower bounds on \(q\)-ary error-correcting codes
From MaRDI portal
Publication:2325290
DOI10.1007/s12095-018-0302-9zbMath1419.94093OpenAlexW2801953439WikidataQ129889674 ScholiaQ129889674MaRDI QIDQ2325290
Antti Laaksonen, Patric R. J. Östergård
Publication date: 25 September 2019
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-018-0302-9
Bounds on codes (94B65) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\)
- Classification algorithms for codes and designs
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- Codes from affine permutation groups
- Small additive quaternary codes.
- Classification of binary/ternary one-error-correcting codes
- New lower bounds on error-correcting ternary, quaternary and quinary codes
- New nonbinary code bounds based on divisibility arguments
- Semidefinite bounds for nonbinary codes based on quadruples
- Constructing error-correcting binary codes using transitive permutation groups
- Constructing transitive permutation groups.
- Two new four-error-correcting binary codes
- There exists no (15,5,4) RBIBD†*
- Some Bounds on the Size of Codes
- The Transitive Permutation Groups of Degree 32
- Bounds on mixed binary/ternary codes
- A table of upper bounds for binary codes
- Error-correcting codes over an alphabet of four elements
- Bounds on codes over an alphabet of five elements
