Codes of small defect (Q676729): Difference between revisions

The parameters of a linear code \(C\) over \(GF(q)\) are given by \([n,k,d]\), where \(n\) denotes the length, \(k\) the dimension and \(d\) the minimum distance of \(C\). The code \(C\) is called MDS, or maximum distance separable, if the minimum distance \(d\) meets the Singleton bound, i.e. \(d=n -k+1\). Unfortunately, the parameters of an MDS code are severely limited by the size of the field. Thus we look for codes which have minimum distance close to the Singleton bound. Of particular interest is the class of almost MDS codes, i.e. codes for which \(d= n-k\). We will present a condition on the minimum distance of a code to guarantee that the orthogonal code is an almost MDS code. This extends a result of Dodunekov and Landgev. Evaluation of the MacWilliams identities leads to a closed formula for the weight distribution which turns out to be completely determined for almost MDS codes up to one parameter. As a consequence we obtain surprising combinatorial relations in such codes. This leads, among other things, to an answer to a question of Assmus and Mattson on the existence of self-dual \([2d,d,d]\)-codes which have no code words of weight \(d+1\). Actually there are more codes than Assmus and Mattson expected, but the examples which we know are related to the expected ones.