Author/Authors :
T.Aaron Gulliver، نويسنده , , Patric R.J. ostergard، نويسنده , , Nikolai Senkevitch، نويسنده ,
Abstract :
In this paper, we classify all optimal linear [n,n/2,d] codes over F5 up to length 12, and show that there are unique optimal [4,2,3] and [6,3,4] codes, up to equivalence. We also classify all optimal linear [n,n/2,d] codes over F7 up to length 8, and present a number of optimal codes of length 10. It is shown that this is the smallest field with two inequivalent [n,n/2] maximum distance separable codes of the same length.
