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 l (l ? 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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
