Some new results on optimal codes over \(\mathbb F_5\) (Q1406882): Difference between revisions

The authors classify all strongly optimal AMDS codes (``almost maximum distance seperable codes'', i.e. linear codes of dimension \(k\) and length \(n\) with minimal distance \(d = n-k\) over the field GF\((5)\) and determine their weight enumerators. They show that no AMDS code with \(n= 13\) and \(d=5\) exists. Furthermore, they present a classification of \([n, k, d]\)-Griesmer codes (codes attaining the Griesmer bound) of dimension \(4\) over GF\((5)\) for \([n, k, d] = [39, 4, 30], [70, 4, 55]\) and \([101, 4, 80]\) and list generator matrices for all inequivalent types. The main tools are the dual transform [cf. \textit{A. Brouwer} and \textit{M. van Eupen}, ibid. 11, 261--266 (1997; Zbl 0872.94043) or \textit{S. Dodunekov} and \textit{J. Simonis}, Electron. J. Comb. 5, No. 1, Research paper R37 (1998; Zbl 0928.94009)] and extensive computer search using the software program Q-EXTENSION [cf. \textit{J. Bouyukliev} and \textit{J. Simonis}, Some new results for optimal ternary linear codes, IEEE Trans.\ Inf. Theory 48/4, 981--985 (2002)].