MacWilliams Extension Theorem for MDS codes over a vector space alphabet
نویسنده
چکیده
The MacWilliams Extension Theorem states that each linear isometry of a linear code extends to a monomial map. Unlike the linear codes, in general, additive codes do not have the extension property. In this paper, an analogue of the extension theorem for additive codes in the case of additive MDS codes is proved. More precisely, it is shown that for almost all additive MDS codes their additive isometries extend to isometries of the ambient space.
منابع مشابه
MacWilliams Extension Theorems and the Local-Global Property for Codes over Rings
The MacWilliams extension theorem is investigated for various weight functions over finite Frobenius rings. The problem is reformulated in terms of a local-global property for subgroups of the general linear group. Among other things, it is shown that the extension theorem holds true for poset weights if and only if the underlying poset is hierarchical. Specifically, the Rosenbloom-Tsfasman wei...
متن کاملCharacteristics of invariant weights related to code equivalence over rings
The Equivalence Theorem states that, for a given weight on the alphabet, every linear isometry between linear codes extends to a monomial transformation of the entire space. This theorem has been proved for several weights and alphabets, including the original MacWilliams’ Equivalence Theorem for the Hamming weight on codes over finite fields. The question remains: What conditions must a weight...
متن کاملIsometries of Additive Codes
(June 15, 2016.) FIX: June 15, 2016. This needs to be re-written. Monomial transformations of linear codes are linear isometries for the Hamming weight. A code alphabet has the extension property for the Hamming weight when every linear isometry between codes extends to a monomial transformation. MacWilliams proved that finite fields have the extension property for the Hamming weight. In contra...
متن کاملElias Upper Bound for Euclidean Space Codes and Codes Close to the Singleton Bound
A typical communication system consists of a channel code to transmit signals reliably over a noisy channel. In general the channel code is a set of codewords which are used to carry information over the channel. This thesis deals with Elias upper bound on the normalized rate for Euclidean space codes and on codes which are close to the generalized Singleton bound, like MaximumDistance Separabl...
متن کاملFoundations of Linear Codes Defined over Finite Modules: the Extension Theorem and the Macwilliams Identities — Based on Lectures for the Cimpa-unesco-tübi̇tak Summer School
This paper discusses the foundations of the theory of linear codes defined over finite modules. Two topics are examined in depth: the extension theorem and the MacWilliams identities. Both of these topics were studied originally by MacWilliams in the context of linear codes defined over finite fields.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 82 شماره
صفحات -
تاریخ انتشار 2017