Abstract
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 Dodunekov. 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 5 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.
Similar content being viewed by others
References
E. F. Assmus, Jr. and H. F. Mattson, Jr., On weights in quadratic-residue codes, Discrete Mathematics, Vol. 3 (1972) pp. 1–20.
M. A. de Boer, Almost MDS codes, to appear in Designs, Codes and Cryptography.
S. M. Dodunekov and I. N. Landgev, On near-MDS codes, report LiTH-ISY-R-1563, Dept. of Electrical Engineering, Linköping University (1994).
J. H. van Lint, Introduction to Coding Theory, Springer-Verlag, New York (1982).
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, sixth printing (1988).
S. Roman, Coding and Information Theory, Springer-Verlag, New York (1992).
M. A. Tsfasman and S. G. Vlăduţ, Algebraic-Geometric Codes, Kluwer Academic Publishers, Dordrecht (1991).
V. K. Wei, Generalized hamming weights for linear codes, IEEE Trans. Inf. Theory, Vol. 37 (1991) pp. 1412–1418.
A. Faldum and W. Willems, A characterization of codes with extreme parameters, to appear IEEE Trans. Inf. Theory, 42 (1996).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Faldum, A., Willems, W. Codes of Small Defect. Designs, Codes and Cryptography 10, 341–350 (1997). https://doi.org/10.1023/A:1008247720662
Issue Date:
DOI: https://doi.org/10.1023/A:1008247720662