Optimal additive quaternary codes of dimension $3.5$ and $4$
arXiv:2410.0765089.11 citationsh-index: 1
AI Analysis
This is an incremental result for coding theorists working on additive quaternary codes.
The authors determined the optimal parameters of additive quaternary codes of dimensions 3.5 and 4, completing the classification for these cases and solving the problem for arbitrary dimension under large minimum distance.
After the optimal parameters of additive quaternary codes of dimension $k\le 3$ have been determined there is some recent activity to settle the next case of dimension $k=3.5$. Here we complete dimension $k=3.5$ and $k=4$. We also solve the problem of the optimal parameters of additive quaternary codes of arbitrary dimension when assuming a sufficiently large minimum distance.