You are here

Home » Content

MacWilliams Identity for m-spotty Hamming Weight Enumerator Over the Ring $\mathbb{F}_2+v\mathbb{F}_2$

Journal Name:

  • European Journal of Pure and Applied Mathematics

Publication Year:

  • 2012

Key Words:

Author NameUniversity of AuthorFaculty of Author

AMS Codes:

Abstract (2. Language): 
The m-spotty byte error control codes can correct or detect multiple spotty byte errors that are distributed in multiple bytes. These codes are successfully applied to computer memory systems that use RAM chips with b-bit Input/Output data when high-energy particles strike a particular RAM chips. In this paper, we derive a MacWilliams type identity for m-spotty Hamming weight enumerator over the ring F2 + vF2 with v2 = v.
Bookmark/Search this post with
FULL TEXT (PDF): 
PDF icon arastirmax-macwilliams-identity-m-spotty-hamming-weight-enumerator-over-ring-mathbbf2vmathbbf2.pdf
  • 3
373-379
  • English

REFERENCES

References: 

[1] I ¸Siap. An identity between the m-spotty weight enumerators of a linear code and its
dual. Turkish Journal of Mathematics, TBD, Accepted in 2011.
[2] F J MacWilliams. A Theorem on the distribution of weights in a systematic code. Bell
System Tech. J., 42:79–94, 1963.
[3] F J MacWilliams and N J Sloane. The Theory of Error-Correcting Codes. North-Holland
Publishing Co., 1977.
[4] M Özen and V ¸Siap. The Macwilliams identity for m-spotty weight enumerators of linear
codes over finite fields. Comput. Math. Appl., 61(4):1000–1004, 2011.
[5] K Suzuki and E Fujiwara. Macwilliams identity for m-spotty weight enumerator. IEICE
Transactions, E93-A(2):526–531, 2010.
[6] K Suzuki, T Kashiyama, and E Fujiwara. A general class of m-spotty byte error control
codes. IEICE Transactions, 90-A(7):1418–1427, 2007.
[7] G Umanesan and E Fujiwara. A class of random multiple bits in a byte error correcting
and single byte error detecting codes. IEEE Trans. Computers, 52(7):835–847, 2003.

Thank you for copying data from http://www.arastirmax.com