MacWilliams identities for poset level weight enumerators of linear codes
نویسندگان
چکیده
Codes over various metrics such as Rosenbloom-Tsfasman (RT), Lee, etc. have been considered. Recently, codes over poset metrics have been studied. Poset metric is a great generalization of many metrics especially the well-known ones such as the RT and the Hamming metrics. Poset metric can be realized on the channels with localized error occurrences. It has been shown that MacWilliams identities are not admissible for codes over poset metrics in general [Kim and Oh, 2005]. Lately, to overcome this problem some further studies on MacWilliams identities over poset metrics has been presented. In this paper, we introduce new poset level weight enumerators of linear codes over Frobenius commutative rings. We derive MacWilliams-type identities for each of the given enumerators which generalize in great deal the previous results discussed in the literature. Most of the weight enumerators in the literature such as Hamming, Rosenbloom-Tsfasman and complete m-spotty weight enumerators follow as corollaries to these identities especially.
منابع مشابه
MacWilliams type identities on the Lee and Euclidean weights for linear codes over ℤℓ
Abstract Motivated by the works of Shiromoto [3] and Shi et al. [4], we study the existence of MacWilliams type identities with respect to Lee and Euclidean weight enumerators for linear codes over Zl. Necessary and sufficient conditions for the existence of MacWilliams type identities with respect to Lee and Euclidean weight enumerators for linear codes over Zl are given. Some examples about s...
متن کاملMacWilliams-type identities for fragment and sphere enumerators
Let P = n11 ⊕ · · · ⊕ nt1 be the poset given by the ordinal sum of the antichains ni1 with ni elements. We derive MacWilliams-type identities for the fragment and sphere enumerators, relating enumerators for the dual C of the linear code C on P and those for C on the dual poset P̌. The linear changes of variables appearing in the identities are explicit. So we obtain, for example, the P-weight d...
متن کاملMacWilliams Type identities for $m$-spotty Rosenbloom-Tsfasman weight enumerators over finite commutative Frobenius rings
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 enumerator...
متن کاملA Classi£cation of Posets admitting MacWilliams Identity
In this paper all poset structures are classi£ed which admit the MacWilliams identity, and the MacWilliams identities for poset weight enumerators corresponding to such posets are derived. We prove that being a hierarchical poset is a necessary and suf£cient condition for a poset to admit MacWilliams identity. An explicit relation is also derived between P-weight distribution of a hierarchical ...
متن کاملMacWilliams Identities for $m$-tuple Weight Enumerators
Since MacWilliams proved the original identity relating the Hamming weight enumerator of a linear code to the weight enumerator of its dual code there have been many different generalizations, leading to the development of m-tuple support enumerators. We prove a generalization of theorems of Britz and of Ray-Chaudhuri and Siap, which build on earlier work of Kløve, Shiromoto, Wan, and others. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1408.1560 شماره
صفحات -
تاریخ انتشار 2014