MacWilliams Type identities for $m$-spotty Rosenbloom-Tsfasman weight enumerators over finite commutative Frobenius rings

Abstract

The $m$-spotty byte error control codes provide a good source for detecting and correcting errors in semiconductor memory systems using high density RAM chips with wide I/O data (e.g. 8, 16, or 32 bits). $m$-spotty byte error control codes are very suitable for burst correction. M. Özen and V. Siap [7] proved a MacWilliams identity for the $m$-spotty Rosenbloom-Tsfasman (shortly RT) weight enumerators of binary codes. The main purpose of this paper is to present the MacWilliams type identities for $m$-spotty RT weight enumerators of linear codes over finite commutative Frobenius rings.

arXiv commentResearch article, orignial manuscript under review since 2nd November 2012. 9 pages, 4 Tables. arXiv admin note: substantial text overlap with arXiv:1307.1786, arXiv:1307.2228