Article PDF
Avoid common mistakes on your manuscript.
References
E.F.Assmus,Jr., H.F.Mattson, New 5-designs,J.Combin. Theory 6(1969), 122–151.
E.F.Assmus,Jr., H.F.Mattson, Coding and Combinatorics,SIAM Review 16(1974), 349–388.
S.M.Ball, On Sets of Points in Finite Planes, manuscript.
R.Calderbank, W.M.Kantor, The Geometry of Two-weight Codes,Bull. London Math. Soc. 18(1986), 97–122.
S.M.Dodunekov, A Note on the Weight Structure of Generator Matrices of Linear Codes,Problemi Peredachi Informacii 26(1990), 101–104, in Russian.
I.I.Dumer, V.A.Zinoviev, Some New Maximal Codes over GF(4),Problemi Peredachi Informacii 14(1978), 24–34 in Russian.
M.J.E.Golay, Notes on Digital Coding,Proc. IEEE 37(1949), 657.
J.H.Griesmer, A Bound for Error-correcting Codes,IBM J. Res. Develop. 4(1960), 532–542.
W.Heise, P.Quattrocchi,Informations- und Codierungstheorie, Springer, Berlin-Heidelberg, 1988.
R.Hill, J.Mason, On (k,n)-arcs and the Falsity of Lunelli-Sce Conjecture,London Math. Soc. Lecture Note Series 49(1981), 153–168.
J.W.P.Hirschfeld,Projective Geometries over Finite Fields, Clarendon Press, Oxford, 1979.
F.J.MacWilliams, N.J.A.Sloane,The Theory of Error-correcting Codes, North Holland, Amsterdam, 1977.
J.Thas, Some Results Concerning ((q+1)(n−1),n)-arcs,J.Combin. Theory Ser.A 19(1975), 228–232.
V.D.Tonchev,Combinatorial Configurations, Longman, Wiley, New York, 1988.
M.A.Tsfasman, S.G.Vladut,Algebraic-geometric Codes, Kluwer Academic Publishers, Dordrecht-Boston-London, 1991.
V.K.Wei, Generalized Hamming Weights for Linear Codes,IEEE Trans. Inform. Theory IT-37(1991), 1412–1418.
Author information
Authors and Affiliations
Additional information
Partially supported by the Bulgarian NSF under contract I-35/1991
Supported by the Commission of the EC Contract CIPA 3511 CT 922960
Rights and permissions
About this article
Cite this article
Dodunekov, S., Landgev, I. On near-MDS codes. J Geom 54, 30–43 (1995). https://doi.org/10.1007/BF01222850
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01222850