A generalized Gleason-Pierce-Ward theorem
The authors generalize the Gleason-Pierce-Ward theorem on linear divisible codes to additive divisible codes. Here, a divisible code is defined as a code whose codewords all have Hamming weights divisible by some integer \(\Delta>1\). An additive code over GF\((q)\) of length \(n\) is a subset of GF\((q)^n\) closed under vector addition, that is a GF\((p)\)-linear code of GF\((q)^n\) for \(q=p^ m\) and prime \(p\). The main result is the following: Suppose that \(\mathcal{C}\) is an additive divisible code over GF\((q)^n\) (with \(q=p^m\)) of length \(n\) and size \(p^k\) with \(k=\frac{m\cdot n}{2}\) and divisor \(\Delta>1\). Then one or more of the following holds: (I) \(q=2\) and \(\Delta =2\) (II) \(q=2\), \(\Delta=4\) and \(\mathcal{C}\) is self-dual. (III) \(q=3\), \(\Delta=3\) and \(\mathcal{C}\) is self-dual. (IV) \(q=4\), \(\Delta =2\) and \(\mathcal{C}\) is trace self-dual (see below) and (V) \(\Delta=2\) and \(\mathcal{C}\) is equivalent to the linear code over GF\((p^m)\) with generator matrix \([I_{n/2},I_{n/2}]\). An additive code \(\mathcal{C}\) over GF\((4)\) is called trace self-dual if \(\mathcal{C}=\mathcal{C}^\bot\) where the dual is formed by the trace inner product \(\langle(x_1,\dots, x_n),(y_1,\dots,y_n)\rangle=\sum^n_{i=1}(x_iy^2_i+x^2_iy_i)\). Two additive codes over GF\((q)\) are called equivalent if one can be obtained from the other by rearranging and/or re-scaling (that is applying an additive automorphism of GF\((q)\) on the coordinates). The codes described in type (V) are not necessarily linear because re-scaling only keeps GF\((p)\)-linearity.
- A bound for divisible codes
- A lemma on polynomials modulo \(p^m\) and applications to coding theory
- A note on formally self-dual even codes of length divisible by 8
- Classification of type IV self-dual \(\mathbb{Z}_4\)-codes of length 16
- Construction of optimal Type IV self-dual codes over F/sub 2/+uF/sub 2/
- Divisible codes
- Duality for modules over finite rings and applications to coding theory
- Fundamentals of Error-Correcting Codes
- Higher weights for ternary and quaternary self-dual codes*
- scientific article; zbMATH DE number 3543912 (Why is no real title available?)
- scientific article; zbMATH DE number 1284416 (Why is no real title available?)
- scientific article; zbMATH DE number 1284422 (Why is no real title available?)
- On designs and formally self-dual codes
- On the classification and enumeration of self-dual codes
- On the minimum weights of type IV codes over \(\mathbb{Z}_4\) with certain lengths
- On type IV self-dual codes over \(\mathbb Z_4\)
- Optimal Self-Dual Codes Over>tex<$ BBF _2times BBF _2$>/tex<With Respect to the Hamming Weight
- Quantum error correction via codes over GF(4)
- Some results on type IV codes over Z4
- The divisible code bound revisited
- Type IV self-dual codes over rings
- Weight distributions of linear codes and the Gleason-Pierce theorem
- The multi-form generalised Gleason theorem
- Weight distributions of linear codes and the Gleason-Pierce theorem
- scientific article; zbMATH DE number 3914999 (Why is no real title available?)
- A Ward type bound for additive divisible codes over finite abelian groups and its application
- An equivalence of Ward's bound and its application
This page was built for publication: A generalized Gleason-Pierce-Ward theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q735040)
