A duality for nonabelian group codes (2402.17597v1)
Abstract: In 1962, Jesse MacWilliams published a set of formulas for linear and abelian group codes that among other applications, were incredibly valuable in the study of self-dual codes. Now called the MacWilliams Identities, her results relate the weight enumerator and complete weight enumerator of a code to those of its dual code. A similar set of MacWilliams identities has been proven to exist for many other types of codes. In 2013, Dougherty, Sol\'{e}, and Kim published a list of fundamental open questions in coding theory. Among them, Open Question 4.3: "Is there a duality and MacWilliams formula for codes over non-Abelian groups?" In this paper, we propose a duality for nonabelian group codes in terms of the irreducible representations of the group. We show that there is a Greene's Theorem and MacWilliams Identities which hold for this notion of duality. When the group is abelian, our results are equivalent to existing formulas in the literature.
- Alexander Barg. The matroid of supports of a linear code. Applicable Algebra in Engineering, Communication and Computing, 8(2):165–172, 1997.
- Type ii codes over z4subscript𝑧4z_{4}italic_z start_POSTSUBSCRIPT 4 end_POSTSUBSCRIPT. IEEE Transactions on Information Theory, 43(3):969–976, 1997.
- Thomas Britz. MacWilliams identities and matroid polynomials. Electron. J. Combin., 9(1):Research Paper 19, 16, 2002.
- Thomas Britz. Code enumerators and tutte polynomials. IEEE Transactions on Information Theory, 56(9), September 2010.
- Matroid Applications, chapter The Tutte Polynomial and Its Applications. Cambridge University Press, 1992.
- Quasi-uniform codes and their applications. IEEE Transactions on Information Theory, 59(12):7915–7926, December 2013.
- Open problems in coding theory. 07 2013.
- Cyclic codes over z4subscript𝑧4z_{4}italic_z start_POSTSUBSCRIPT 4 end_POSTSUBSCRIPT of even length. Designs, Codes and Cryptography, 39(2):127–153, 2006.
- G. David Forney, Jr. On the hamming distance properties of group codes. IEEE Transactions on Information Theory, 38(6):1797–1801, November 1992.
- Curtis Greene. Weight enumeration and the geometry of linear codes. Studies in Applied Mathematics, 55(2), 1976.
- The z4-linearity of kerdock, preparata, goethals, and related codes. IEEE Transactions on Information Theory, 40(2), March 1994.
- M. Ryan Julian, Jr. No macwilliams duality for codes over nonabelian groups. Journal of Algebra Combinatorics Discrete Structures and Applications, 5(1):45–49, 2017.
- Michael Klemm. Über die identität von macwilliams für gewichtsfunktion von codes. Archiv der Mathematik, 49(5):400–406, 1987.
- F. J. MacWilliams. A theorem on the distribution of weights in a systematic code. Bell Systems Technical Journal, 42:79–94, 1963.
- The Theory of Error-Correcting Codes. North Holland, 1977.
- James Oxley. Matroid Theory. Oxford University Press, second edition, 2011.
- Jean-Pierre Serre. Linear Representations of Finite Groups. Springer-Verlag, 1977.
- Polymatroids are to finite groups as matroids are to finite fields. In Preparation.
- Jay A. Wood. Duality for modules over finite rings and applications to coding theory. American Journal of Mathematics, 121(3):555–575, June 1999.
- Alexander Xue. Combinatorial laplacians on binary spherical quotients. Sr. thesis, Cornell University, 2021.