2024/10/10 by Kurz, Sascha
#51E22 #94Bxx #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT)
paper · doi:10.48550/arxiv.2410.07650
After the optimal parameters of additive quaternary codes of dimension k≤ 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 give partial results for dimension 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.