The MacWilliams theorem for two-dimensional modulo metrics
The author considers special representations of finite fields (as Gaussian integers and as Eisenstein-Jacobi integers). These representations lead in a more or less natural way to the introduction of different metrics in the finite dimensional vector spaces over these fields. The distances and weights of linear codes in terms of these metrics can be studied. The author shows that starting from the MacWilliams Identities for the complete weight enumerator of linear codes and by grouping the field elements into classes and then identifying the elements in the same class (depending on the representation of the field) it is possible to obtain MacWilliams Identities with respect to the Mannheim (resp. EJ) weight enumerator. These ``special weight enumerators could be used to obtain the decoding error probabilities that could be tied up with the given metrics.
- On application of the modulus metric to solving the minimum Euclidean distance decoding problem
- On codes over quaternion integers
- scientific article; zbMATH DE number 1795934 (Why is no real title available?)
- scientific article; zbMATH DE number 2154147 (Why is no real title available?)
- scientific article; zbMATH DE number 1424157 (Why is no real title available?)
- Decoding of cyclic codes over quaternion integers by modified Berlekamp–Massey algorithm
This page was built for publication: The MacWilliams theorem for two-dimensional modulo metrics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1352420)