Witt Theorems for Linear Codes over Finite Frobenius Rings
نویسنده
چکیده
منابع مشابه
Computation of Minimum Hamming Weight for Linear Codes
In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$ which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...
متن کاملDuality for Modules over Finite Rings and Applications to Coding Theory
This paper sets a foundation for the study of linear codes over nite rings. The nite Frobenius rings are singled out as the most appropriate for coding theoretic purposes because two classical theorems of MacWilliams, the extension theorem and the MacWilliams identities, generalize from nite elds to nite Frobenius rings. It is over Frobenius rings that certain key identi cations can be made bet...
متن کاملExtension Theorems for Linear Codes over Finite Rings
Various forms of the extension problem are discussed for linear codes de ned over nite rings. The extension theorem for symmetrized weight compositions over nite Frobenius rings is proved. As a consequence, an extension theorem for weight functions over certain nite commutative rings is also proved. The proofs make use of the linear independence of characters as well as the linear independence ...
متن کاملA note on the Singleton bounds for codes over finite rings
In this paper, we give a notation on the Singleton bounds for linear codes over a finite commutative quasi-Frobenius ring in the work of Shiromoto [5]. We show that there exists a class of finite commutative quasi-Frobenius rings. The Singleton bounds for linear codes over such rings satisfy d(C) − 1 A ≤ n− log|R| |C|. keywords : Linear codes, General weight, Quasi-Frobenius ring, Singleton bounds
متن کاملApplications of Finite Frobenius Rings to the Foundations of Algebraic Coding Theory
This article addresses some foundational issues that arise in the study of linear codes defined over finite rings. Linear coding theory is particularly well-behaved over finite Frobenius rings. This follows from the fact that the character module of a finite ring is free if and only if the ring is Frobenius.
متن کامل