New results and bounds on codes over $GF(17)$
DOI:
https://doi.org/10.13069/jacodesmath.v11i1.257Keywords:
Quasi-cyclic codes, Quasi-twisted codes, Search algorithms for linear codes, Distance bounds, Lower bounds, Upper bounds, Optimal codesAbstract
Determining the best possible values of the parameters of a linear code is one of the most fundamental and challenging problems in coding theory. There exist databases of best-known linear codes (BKLC) over small finite fields. In this work, we establish a database of BKLCs over the field $GF(17)$ together with upper bounds on the minimum distances for lengths up to $150$ and dimensions up to $6$. In the process, we have found many new linear codes over $GF(17)$.
Received: 10 August 2022 | Accepted: 5 December 2022Downloads
Download data is not yet available.
Downloads
Published
2023-10-23
How to Cite
Chen, E., Aydin, N., Jönsson , F. ., & Klonowska, K. . (2023). New results and bounds on codes over $GF(17)$. Journal of Algebra Combinatorics Discrete Structures and Applications, 11(1), 27–39. https://doi.org/10.13069/jacodesmath.v11i1.257
Issue
Section
Articles
