2000 character limit reached
MacWilliams Type identities for $m$-spotty Rosenbloom-Tsfasman weight enumerators over finite commutative Frobenius rings (1307.2555v1)
Published 6 Jul 2013 in cs.IT and math.IT
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. \"{O}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.