Indexed metadata
Duality for modules over finite rings and applications to coding theory
Jay A. Wood
Source abstract
This paper sets a foundation for the study of linear codes over finite rings. The finite 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 finite fields to finite Frobenius rings. It is over Frobenius rings that certain key identifications can be made between the ring and its complex characters.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.