2024/06/13 by Simeon Ball, Ball, Simeon, Michel Lavrauw +3 · 6 citations
Computer Science · #94B65 #Coding theory and cryptography #Combinatorics (math.CO) #Cooperative Communication and Network Coding #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Quantum Computing Algorithms and Architecture
paper · pdf · doi:10.48550/arxiv.2406.08916
openalex publication_date 2024/06/13 · openalex created_date 2024/06/15 · openalex updated_date 2026/07/28
In this article we prove Griesmer type bounds for additive codes over finite fields. These new bounds give upper bounds on the length of maximum distance separable (MDS) codes, codes which attain the Singleton bound. We will also consider codes to be MDS if they attain the fractional Singleton bound, due to Huffman. We prove that this bound in the fractional case can be obtained by codes whose length surpasses the length of the longest known codes in the integral case. For small parameters, we provide exhaustive computational results for additive MDS codes, by classifying the corresponding (fractional) subspace-arcs. This includes a complete classification of fractional additive MDS codes of size 243 over the field of order 9.