Abstract
In this paper we apply divisibility techniques to obtain new results on the covering radius of certain cyclic codes.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
E.F. Assmus, Jr. and H.F. Mattson Jr., Some 3-Error Correcting BCH Codes Have Covering Radius 5, IEEE Trans. Inform. Th, 22, pp. 348–349, 1976.
J. Ax, Zeros of Polynomials over Finite Fields, Am. J. Math., 86, 1964, pp. 255–261.
R.D. Baker, J.H. van Lint, and R.M. Wilson, On the Preparata and Goethals Codes, IEEE Trans. on Inform Theory, 29, no. 1, pp. 342–345, 1983.
C. Chevalley, Demonstration d’une hypothese de M. Artin, Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, 11, pp. 73–75, 1936.
G. Cohen, L. Honkala, S. Litsyn, and A. Lobstein, Covering Radius, North-Holland Mathematical, Library 54, 1997.
T. Helleseth, All Binary 3-Error-Correcting BCH Codes of Length 2m − 1 Have Covering Radius 5, IEEE Trans. Inform. Th., 24, pp. 257–258, 1978.
T. Helleseth, On the Covering Radius of Cyclic Linear Codes and Arithmetic Codes, Discrete Applied Mathematics, 11, pp. 157–173 (1985).
H. Janwa and R. M. Wilson, Hyperplane Sections of Fermat Varieties in P 3 in Char. 2 and Applications to Cyclic Codes, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Proceedings AAECC-10 (G. Cohen, T. Mora, and O. Moreno Eds.), Lecture Notes in Computer Science, Springer-Verlag, New York/Berlin 1993.
T. Kasami, Weight Distribution of Bose-Chaudhuri-Hocquenghen Codes, Combinatorial Math. and its Applications (R.C. Bose and T.A. Dowling, eds.), Univ. of North Carolina Press, Chapel Hill, NC 1969.
T. Kasami, Weight Enumerators of several Classes of Subcodes of the and Order Binary Reed-Muller Codes, Info. and Control, 18 (1971), pp. 369–394.
N.M. Katz, On a Theorem of Ax, Am. J. Math., 93, 1971, pp. 485–499.
F.J. MacWilliams and N.J.A. Sloane, Theory of Error-Correcting Codes, North-Holland Publ. Comp., 1977.
O. Moreno and C.J. Moreno, Improvement of Chevalley-Warning and the Ax-Katz Theorems, Am. J. Math., 117, no. 1, pp. 241–244, 1995.
O. Moreno and F.N. Castro, Divisibility Properties for Covering Radius of Certain Cyclic Codes (accepted).
O. Moreno and F.N. Castro, Improvement of Ax-Katz and Moreno-Moreno Results and Applications (submitted).
O. Moreno, W. Shum, F.N. Castro, and P. Vijay Kumar, An Improved Tight Bound for the Divisibility of Exponential Sums (submitted).
C. Roos, A New Lower Bound for the Minimum Distance of a Cyclic Code, IEEE Trans. on Inform Theory, 29, no. 3, pp. 330–332, 1983.
C. Small, Sums of Powers in Large Finite Fields, Proc. Amer. Soc. 65 (1977), pp. 35–36.
J.A. van der Horst and T. Berger, Complete Decoding of Triple-Error-Correcting Binary BCH Codes, IEEE Trans. Inform. Theory, 22, pp. 138–147.
J.H. van Lint, Introduction to Coding Theory, GTM, Springer-Verlag 1992.
J.H. van Lint and R.M. Wilson, On the Minimum Distance of Cyclic Codes, IEEE Trans. Inform. Theory, 32, pp. 23–40.
E. Warning, “Bemerkung zur vorstehenden Arbeit von Herrn Chevalley” Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, 11 (1936), pp. 76–83.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moreno, O., Castro, F.N. (2003). On the Covering Radius of Certain Cyclic Codes. In: Fossorier, M., Høholdt, T., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2003. Lecture Notes in Computer Science, vol 2643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44828-4_15
Download citation
DOI: https://doi.org/10.1007/3-540-44828-4_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40111-7
Online ISBN: 978-3-540-44828-0
eBook Packages: Springer Book Archive