Abstract
In this paper we give an upper bound for the minimum distance of the q-ary image of a linear code over GF(qs). This allows us to give some indications about the minimum distance of the q-ary image of MDS codes over GF(qs) when q=2 and q=3.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
F.J Macwilliams N.J.A. Sloane, "The theory of error correcting codes", North Holland, Amsterdam, (1977).
G. Pasquier, "Etude des codes sur une extension de F2 et de leurs images binaires", Thèse de Doctorat de 3ième cycle, Université de Provence, (1980).
G. Pasquier, "The binary Golay obtained from an extended cyclic code over F8", European J. of Combinatorics 1 (1980) 369–370.
P. Rabizzoni, "Démultipliés de codes sur une extension de Fq", Thèse de Doctorat de 3ième cycle, Université de Provence, (1983).
J. Wolfmann, "A new construction of the binary Golay Code (24, 12, 8) using a group algebra over a finite field", Discrete Math J 1 (1981), 337–338.
V. Zinov'ev, Dumer, "Some new maximal codes over F4", Problems of information Transmission (1979).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rabizzoni, P. (1989). Relation between the minimum weight of a linear code over GF(qm) and its q-ary image over GF(q). In: Cohen, G., Wolfmann, J. (eds) Coding Theory and Applications. Coding Theory 1988. Lecture Notes in Computer Science, vol 388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019859
Download citation
DOI: https://doi.org/10.1007/BFb0019859
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51643-9
Online ISBN: 978-3-540-46726-7
eBook Packages: Springer Book Archive