Randomized trial explores optimal parameters of additive quaternary codes, suggesting improvements in code efficiency.
After the optimal parameters of additive quaternary codes of dimension k<=3 have been determined in [1], there was some activity to settle the next case of dimension k=3.5 [2,3]. Here we complete dimensions 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.
No takes yet. Share an insight, caveat, or question.
Sascha Kurz (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: