New nonbinary code bounds based on divisibility arguments
From MaRDI portal
Publication:1741925
DOI10.1007/s10623-017-0366-0zbMath1414.94955arXiv1606.05144OpenAlexW3101162290WikidataQ59517226 ScholiaQ59517226MaRDI QIDQ1741925
Publication date: 10 April 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.05144
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Grey-Rankin bound for nonbinary codes
- On the construction of \(q\)-ary equidistant codes
- On symmetric nets and generalized Hadamard matrices from affine designs
- Semidefinite bounds for nonbinary codes based on quadruples
- The Code of the Symmetric Net with m = 4 and μ = 2
- Error-correcting codes over an alphabet of four elements
- Bounds on codes over an alphabet of five elements