Skip to main content

Improved Bounds on Weil Sums over Galois Rings and Homogeneous Weights

  • Conference paper
Coding and Cryptography (WCC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 3969))

Included in the following conference series:

Abstract

We generalize a recent improvement for the bounds of Weil sums over Galois rings of characteristic p 2 to Galois rings of any characteristic p l. Our generalization is not as strong as for the case p 2 and we indicate the reason. We give a class of homogeneous weights, including the homogeneous weight defined by Constantinescu and Heise, and we show their relations. We also give an application of our improvements on the homogeneous weights of some codewords.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anderson, D.R.: A new class of cyclic codes. SIAM J. Appl. Math. 16, 181–197 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  2. Blake, I.F., Mark, J.W.: A note on complex sequences with low correlations. IEEE Trans. Inform. Theory 28(5), 814–816 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  3. Constantinescu, I., Heise, T.: A metric for codes over residue class rings of integers. Problemy Peredachi Informatsii 33(3), 22–28 (1997)

    MathSciNet  MATH  Google Scholar 

  4. Helleseth, T.: On the covering radius of cyclic linear codes and arithmetic codes. Disc. Appl. Math. 11, 157–173 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  5. Helleseth, T., Kumar, P.V., Moreno, O., Shanbhag, A.G.: Improved estimates via exponential sums for the minimum distance of ℤ4-linear trace codes. IEEE Trans. Inform. Theory 42(4), 1212–1216 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  6. Kumar, P.V., Helleseth, T., Calderbank, A.R.: An upper bound for Weil exponential sums over Galois rings with applications. IEEE Trans. Inform. Theory 41(2), 456–468 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  7. Ling, S., Özbudak, F.: An improvement on the bounds of Weil exponential sums over Galois rings with some applications. IEEE Trans. Inform. Theory 50(10), 2529–2539 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  8. Ling, S., Özbudak, F.: Improved p-ary codes and sequence families from Galois rings of characteristic p 2. SIAM J. Discrete Math. 19(4), 1011–1028 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  9. Lucas, E.: Sur les congruences des nombres eulériens et des coefficients différentiels des fonctions trigonométriques suivant un module premier. Bull. Soc. Math. France 6, 49–54 (1878)

    Article  MathSciNet  MATH  Google Scholar 

  10. Sidelnikov, V.M.: On mutual correlation of sequences. Soviet Math. Dokl. 12(1), 197–201 (1971)

    MathSciNet  Google Scholar 

  11. Tietäväinen, A.: On the covering radius of long BCH codes. Disc. Appl. Math. 16, 75–77 (1987)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ling, S., Özbudak, F. (2006). Improved Bounds on Weil Sums over Galois Rings and Homogeneous Weights. In: Ytrehus, Ø. (eds) Coding and Cryptography. WCC 2005. Lecture Notes in Computer Science, vol 3969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779360_32

Download citation

  • DOI: https://doi.org/10.1007/11779360_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35481-9

  • Online ISBN: 978-3-540-35482-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics