-
Duality for modules over finite rings and applications to coding theory
- American Journal of Mathematics
- Johns Hopkins University Press
- Volume 121, Number 3, June 1999
- pp. 555-575
- 10.1353/ajm.1999.0024
- Article
- Additional Information
- Purchase/rental options available:
Buy Issue for $25 at JHUP
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.
collapse
You are not currently authenticated.
If you would like to authenticate using a different subscribed institution or have your own login and password to Project MUSE
Authenticate
- Purchase/rental options available:
