Skip to main content

Formal duality of linearly presentable codes over a Galois field

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1255))

Abstract

In [4] it was shown, that the weight enumerators of two binary ℤ4-linearly dual codes satisfy the McWilliams identity (i.e. these codes are formally dual). If we consider an arbitrary Galois ring R=GR(q 2, p 2) of characteristic p 2 and a pair of R-linearly dual codes over a Galois field GF(q) this result is not preserved. We propose the approach to correcting this disadvantage. The titled codes are presented as codes inthe alphabet =RS q (q,2), being a Reed-Solomon code. The appropriate exact weight enumerators of these codes are reduced to some projective weight enumerators (obtained by identifying of variables) which satisfy the McWilliams identity for linear codes over GF(q). We discuss ways of “optimal” identifying of variables such that the corresponding projective weight enumerators allow us to construct complete weight enumerators of the initial codes over GF(q).

This work was supported in part by grant RFFR 96-0100627.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Nechaev A.A., Kuzmin A.S. “Linearly presentable codes”, Proceedings of the 1996 IEEE Int. Symp. Inf. Theory and Appl., Victoria B.C., Canada, 1996, pp. 31–34.

    Google Scholar 

  2. Nechaev A.A. “Trace function in Galois ring and noise stable codes” (in Russian), V All-Union Symp. on theory of rings, algebras and modules, Novosibirsk, p. 97, 1982.

    Google Scholar 

  3. Nechaev A.A. Kerdock code in a cyclic form (in Russian). Diskr. Math. (USSR), 1 (1989), N 4, 123–139. English translation: Diskrete Math. and Appl., 1 (1991), N 4, 365–384 (VSP).

    Google Scholar 

  4. Hammons A.R., Kumar P.V., Calderbank A.R., Sloane N.J.A., Solé P. “The ℤ4-linearity of Kerdock, Preparata, Göthals and related codes”, IEEE Trans. Inf. Theory, vol. 40, N 2, pp. 301–319, 1994.

    Google Scholar 

  5. Nechaev A.A., Kuzmin A.S. “ℤ4-linearity, two approaches”, Vth Int. Workshop on Alg. and Comb. Coding Theory, Proceedings, Sozopol, Bulgaria, pp. 212–215, 1996.

    Google Scholar 

  6. Kurakin V.L., Kuzmin A.S., Mikhalev A.V., Nechaev A.A. “Linear recurrences over rings and modules”, J. of Math. Science. Contemporary Math. and it's Appl. Thematic surveys, Vol. 10, 1994, J. of Math. Sciences, vol. 76, N 6, pp. 2793–2915, 1995.

    Google Scholar 

  7. Kuzmin A.S., Nechaev A.A. “Linearly presented codes and Kerdock code over an arbitrary Galois field of the characteristic 2”, Russian Math. Surveys, vol. 49, N 5, 1994.

    Google Scholar 

  8. Nechaev A.A. “Linear codes over modules and over spaces: MacWilliams identity”, Proceedings of the 1996 IEEE Int. Symp. Inf. Theory and Appl., Victoria B.C., Canada, 1996, pp. 35–38.

    Google Scholar 

  9. Carlet C. “On ℤ4-duality”, IEEE Trans. Inform. Theory, vol. IT-41, N 5, pp. 1487–1494, 1995.

    Google Scholar 

  10. Klemm M. “Über die Identität von McWilliams für die Gewichtsfunction von codes”, Arch. Math, vol. B 49, pp. 400–406, 1987.

    Google Scholar 

  11. Kuzmin A.S., Nechaev A.A. “Linear recurring sequences over Galois rings”, Algebra and Logic, Plenum Publ. Corp., 34 (1995), N 2.

    Google Scholar 

  12. Lidl R., Niederreiter H. “Finite fields”, Addison-Wesley, London, 1983.

    Google Scholar 

  13. Diedonné J. “La Geometrie des Groupes Classiques”, Ergebnisse der Mathematik und ihrer Grenzgebiete, Band 5, Springer, 1971.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Teo Mora Harold Mattson

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nechaev, A.A., Kuzmin, A.S. (1997). Formal duality of linearly presentable codes over a Galois field. In: Mora, T., Mattson, H. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1997. Lecture Notes in Computer Science, vol 1255. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63163-1_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-63163-1_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63163-7

  • Online ISBN: 978-3-540-69193-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics