Translates of linear codes over Z/sub 4/
General techniques for studying the complete coset weight distributions of quaternary codes are derived and applied to quaternary Kerdock codes and Preparata codes. These two classes of codes have ten distinct complete coset weight enumerators, independently of the code length. The determination of the coset weight enumerators having been solved for few families of codes and allowing the calculation of precise probabilities of correct error-correction, the results contained in this paper are quite interesting. In the cases studied here, they are also related to exponential sums.
- Formal duality in finite abelian groups
- Non-free extensions of the simplex codes over a chain ring with four elements
- One weight \(\mathbb {Z}_2\mathbb {Z}_4\) additive codes
- Codes with the same coset weight distributions as the Z/sub 4/-linear Goethals codes
- Association schemes related to Delsarte-Goethals codes
- New pseudo-planar binomials in characteristic two and related schemes
- NEW OPTIMAL LINEAR CODES OVER
- Equivalence classes of multiplicative central \((p^{n}, p^{n}, p^{n}, 1)\)-relative difference sets
- Weighing matrices and spherical codes
This page was built for publication: Translates of linear codes over Z/sub 4/
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4345617)
