Skip to main content
SpringerLink
Log in

On some new m-spotty Lee weight enumerators

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

One of the objectives of coding theory is to ensure reliability of the computer memory systems that use high-density RAM chips with wide I/O data (e.g. 16, 32, 64 bits). Since these chips are highly vulnerable to m-spotty byte errors, this goal can be achieved using m-spotty byte error-control codes. This paper introduces the m-spotty Lee weight enumerator, the split m-spotty Lee weight enumerator and the joint m-spotty Lee weight enumerator for byte error-control codes over the ring of integers modulo ℓ (ℓ ≥  2 is an integer) and over arbitrary finite fields, and also discusses some of their applications. In addition, MacWilliams type identities are also derived for these enumerators.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Berlekamp E.R.: Negacyclic codes for the Lee metric, Combinatorial Mathematics and its Applications. In: Proc. Conf., Univ. North Carolina, Chapel Hill, N.C., 1967, pp. 298–316 (1969).

  2. Blahut R.E.: Algebraic Codes for Data Transmission. Cambridge University Press, Cambridge (2003)

    Book  MATH  Google Scholar 

  3. Daraiseh A.G.A., Baum C.W.: Decoder error and failure probablities for Reed-Solomon codes: decodable vectors method. IEEE Trans. Commun. 46(7), 857–859 (1998)

    Article  Google Scholar 

  4. dela Cruz R., Meyer A., Sole P.: An extension of Massey scheme for secret sharing, ITW (2010). arXiv:1004.2795v2.

  5. Dougherty S.T., Gulliver T.A., Oura M.: Higher weights for ternary and quaternary self-dual codes. Des. Codes Cryptogr. 38, 97–112 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  6. Dougherty S.T., Gupta M.K., Shiromoto K.: On generalized weights for codes over \({\mathbb{Z}_k}\) . Australas. J. Comb. 31, 231–248 (2005)

    MATH  MathSciNet  Google Scholar 

  7. Dougherty S.T., Han S., Liu H.: Higher weights for code over rings. AAECC 22, 113–135 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  8. Dougherty S.T., Harada M., Oura M.: Note on the g-fold joint weight enumerators of self-dual codes over \({\mathbb{Z}_{k}}\) . Appl. Algebra Eng. Commun. Comput. 11(6), 437–445 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  9. Fields J., Pless V.: Split weight enumerators of extremal self-dual codes. In: Proceedings of the 35th Allerton Conference on Communication, Control and Computing, pp. 422–431, UIUC (1997).

  10. Kaneda S., Fujiwara E.: Single byte error correcting-double byte error detecting codes for memory systems. IEEE Trans. Comput. C- 31(7), 596–602 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  11. Klemm M.: Über die Identität von MacWilliams für die Gewichtsfunktion von Codes. Arch. Math. 49, 400–406 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  12. Lee C.Y.: Some properties of non-binary error-correcting codes. IRE Trans. IT-4, pp. 77–82 (1958).

  13. Ling S., Xing C.: Coding Theory—A First Course. Cambridge University Press, Cambridge (2004)

    Book  Google Scholar 

  14. MacWilliams F.J.: A theorem on the distribution of weights in a systematic code. Bell Syst. Tech. J. 42, 79–94 (1963)

    Article  MathSciNet  Google Scholar 

  15. MacWilliams F.J., Mallows C., Sloane N.: Generalizations of Gleason’s theorem on weight enumerators of self-dual codes. IEEE Trans. Inform. Theory 18(6), 794–805 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  16. Moon T.K.: Error Correction Coding: Mathematical Methods and Algorithms. Wiley, New York (2005)

    Book  Google Scholar 

  17. Nishimura S., Hiramatsu T.: A generalization of the Lee distance and error correcting codes. Discret. Appl. Math. 156(5), 588–595 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  18. Özen M., Şiap V.: The MacWilliams identity for m-spotty weight enumerators of linear codes over finite fields. Comput. Math. Appl. 61(4), 1000–1004 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  19. Sharma A., Sharma A.K.: MacWilliams type identities for some new m-spotty weight enumerators. IEEE Trans. Inform. Theory 58(6), 3912–3924 (2012)

    Article  MathSciNet  Google Scholar 

  20. Sharma A., Sharma A.K.: On a g-fold joint m-spotty Lee weight enumerator. communicated for publication.

  21. Sharma A., Sharma A.K.: On MacWilliams type identities for r-fold joint m-spotty weight enumerators. communicated for publication.

  22. Siap I.: m-spotty weight enumerators of linear codes over the ring \({\mathbb{F}_2+u\mathbb{F}_2}\) . In: Proceedings of the International Workshop on Coding and Cryptography, pp. 92–98, Ullensvang, Norway (2009).

  23. Siap I.: MacWilliams identity for m-spotty Lee weight enumerators. Appl. Math. Lett. 23(1), 13–16 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  24. Siap I., Ray-Chaudhuri D.K.: On r-fold complete weight enumerator of r linear codes. Contemp. Math. 259, American Mathematical Society, pp. 501–513 (2000).

  25. Suzuki K., Kaneko H., Fujiwara E.: MacWilliams identity for m-spotty weight enumerator. In: ISIT 2007, pp. 31–35, Nice, France (2007).

  26. Suzuki K., Kashiyama T., Fujiwara E.: A general class of m-spotty byte error control codes. In: Proceedings of Asian-European Workshop on Information Theory, pp. 24–26, Viareggio, Italy (2004).

  27. Suzuki K., Kashiyama T., Fujiwara E.: A general class of m-spotty byte error control codes. IEICE Trans. 90-A(7), 1418–1427 (2007)

    Article  Google Scholar 

  28. Umanesan G., Fujiwara E.: A class of random multiple bits in a byte error correcting and single byte error detecting (S t/b EC−S b ED) codes. IEEE Trans. Comput. 52(7), 835–847 (2003)

    Article  Google Scholar 

  29. Wolf J.K., Michelson A.M., Levesque A.H.: On the probability of undetected erros for linear block codes. IEEE Trans. Commun. 30(2), 317–324 (1982)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Indian Institute of Technology Delhi, New Delhi, 110016, India

    Anuradha Sharma & Amit K. Sharma

Authors
  1. Anuradha Sharma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amit K. Sharma
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anuradha Sharma.

Additional information

Communicated by J. D. Key.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sharma, A., Sharma, A.K. On some new m-spotty Lee weight enumerators. Des. Codes Cryptogr. 71, 119–152 (2014). https://doi.org/10.1007/s10623-012-9725-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-012-9725-z

Keywords

Mathematics Subject Classification (2000)

Search

Navigation