Coding Theory: A First Course
IEEE Transactions on Computers
Error Correction Coding: Mathematical Methods and Algorithms
Error Correction Coding: Mathematical Methods and Algorithms
Higher Weights for Ternary and Quaternary Self-Dual Codes*
Designs, Codes and Cryptography
Single Byte Error Correcting Double Byte Error Detecting Codes for Memory Systems
IEEE Transactions on Computers
A generalization of the Lee distance and error correcting codes
Discrete Applied Mathematics
A General Class of M-Spotty Byte Error Control Codes
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
The MacWilliams identity for m-spotty weight enumerators of linear codes over finite fields
Computers & Mathematics with Applications
Higher weights for codes over rings
Applicable Algebra in Engineering, Communication and Computing
Generalizations of Gleason's theorem on weight enumerators of self-dual codes
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
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.