Fourier-reflexive partitions and MacWilliams identities for additive codes

@article{GluesingLuerssen2015FourierreflexivePA,
  title={Fourier-reflexive partitions and MacWilliams identities for additive codes},
  author={Heide Gluesing-Luerssen},
  journal={Designs, Codes and Cryptography},
  year={2015},
  volume={75},
  pages={543-563}
}
A partition of a finite abelian group gives rise to a dual partition on the character group via the Fourier transform. Properties of this dualization are investigated, and a convenient test is given for when the bidual partition coincides with the primal partition. Such partitions permit MacWilliams identities for the partition enumerators of additive codes. It is shown that dualization commutes with taking products and symmetrized products of partitions on cartesian powers of the given group… 
Fourier-Reflexive Partitions and Group of Linear Isometries with Respect to Weighted Poset Metric
Let H be the cartesian product of a family of abelian groups indexed by a finite set Ω. A given poset P = (Ω,4P) and a map ω : Ω −→ R + give rise to the (P, ω)-weight on H, which further leads to a
MacWilliams Extension Theorems and the Local-Global Property for Codes over Rings
TLDR
A short character-theoretic proof of the well-known MacWilliams extension theorem for the homogeneous weight is provided and it is shown that the extension theorem carries over to direct products of weights, but not to symmetrized products.
The homogeneous weight partition and its character-theoretic dual
The homogeneous weight on a finite Frobenius ring naturally induces a partition which is invariant under left and right multiplication by units. It is shown that the character-theoretic left-sided
Extension Theorems for Various Weight Functions over Frobenius Bimodules
TLDR
This paper derives alternative proofs for the facts that the Hamming weight and the homogeneous weight satisfy the extension property of the Rosenbloom–Tsfasman weight.
Partitions of Frobenius rings induced by the homogeneous weight
The values of the homogeneous weight are determined for finite Frobenius rings that are a direct product of local Frobenius rings. This is used to investigate the partition induced by this weight and
Duality of codes supported on regular lattices, with an application to enumerative combinatorics
  • A. Ravagnani
  • Mathematics, Computer Science
    Des. Codes Cryptogr.
  • 2018
TLDR
A general class of regular weight functions on finite abelian groups are introduced, and the theory of MacWilliams identities are applied to enumerative combinatorics problems, obtaining closed formulae for the number of rectangular matrices over a finite having prescribed rank and satisfying some linear conditions.
Mac Williams identities and polarized Riemann-Roch conditions
The present note establishes the equivalence of Mac Williams identities for an additive code C and its dual to Polarized Riemann-Roch Conditions on their Zeta-functions. In such a way, the duality of
...
...

References

SHOWING 1-10 OF 53 REFERENCES
MacWilliams Extension Theorems and the Local-Global Property for Codes over Rings
TLDR
A short character-theoretic proof of the well-known MacWilliams extension theorem for the homogeneous weight is provided and it is shown that the extension theorem carries over to direct products of weights, but not to symmetrized products.
MacWilliams Identities for Linear Codes over Finite Frobenius Rings
TLDR
The concept of a W-admissible pair of partitions of the ambient space R n is introduced, and MacWilliams type identities are proved for the corresponding weight spectra of linear codes of length n over R.
MacWilliams Duality and the Rosenbloom—Tsfasman Metric
A new non-Hamming metric on linear spaces over finite fields has recently been introduced by Rosenbloom and Tsfasman [8]. We consider orbits of linear groups preserving the metric and show that
Partitions of Frobenius rings induced by the homogeneous weight
The values of the homogeneous weight are determined for finite Frobenius rings that are a direct product of local Frobenius rings. This is used to investigate the partition induced by this weight and
Duality for modules over finite rings and applications to coding theory
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
Fourier-invariant pairs of partitions of finite abelian groups and association schemes
TLDR
The concept of Fourier-invariant pairs of partitions is introduced and it is demonstrated that this concept is equivalent to the concept of an association scheme in an abelian group.
Linear Codes over Finite Chain Rings
TLDR
It is proved that there exists a one-to-one correspondence between so-called fat linear codes over chain rings and multisets of points in projective Hjelmslev geometries, in the sense that semilinearly isomorphic codes correspond to equivalent multiset and vice versa.
A simple derivation of the MacWilliams identity for linear ordered codes and orthogonal arrays
TLDR
An elementary proof of this generalized MacWilliams identity using group characters is given and it is used to derive an explicit formula for the dual type distribution of a linear ordered code or orthogonal array.
Dual MacWilliams pair
  • D. Kim
  • Mathematics
    IEEE Transactions on Information Theory
  • 2005
TLDR
This work shows that (P, Pbreve) is a weak dual MacWilliams pair if and only if the group of all P-weight preserving linear automorphisms of the ambient n-dimensional space over the finite field acts transitively on every P-sphere centered at 0.
...
...