Divisible codes
A divisible code is a linear code whose words all have weights divisible by some constant larger than one. Certain divisible codes have been conspicuous lately as self-dual codes. The recent survey article by \textit{N. J. A. Sloane} [Proc. Symp. Pure Math. 34, 273--306 (1979; Zbl 0407.94009)] indicates why self-dual codes are so interesting and provides an extensive bibliography. Their study begins with a theorem of Gleason and Pierce giving constraints on the divisor and field size for divisible codes that are formally self-dual in the sense of having the same weight enumerator as their orthogonals. These codes can also be viewed as divisible codes having the largest conceivable dimension for their length (except when the field size and divisor are both 2). The first result of the present paper is a recasting of the Gleason-Pierce theorem from this standpoint. It is proved by elementary considerations that lead to another recast theorem extending one of \textit{F. J. MacWilliams} on the equivalence of irreducible binary cyclic codes of odd length [Bell Syst. Tech. J. 44, 303--332 (1965; Zbl 0132.39902)].
- scientific article; zbMATH DE number 1767697
- An introduction to divisible codes
- On the Lengths of Divisible Codes
- A bound for divisible codes
- Divisors of codeword weights
- A selection of divisible lexicographic codes
- Divisors of codes of Reed-Muller type
- Binary divisible codes of maximum dimension
- Separable Codes
- scientific article; zbMATH DE number 1284422
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3634154 (Why is no real title available?)
- scientific article; zbMATH DE number 3400774 (Why is no real title available?)
- Minimal codes in Abelian group algebras
- Self-dual codes over GF(4)
- The Structure and Properties of Binary Cyclic Alphabets
- Codes with given distances
- Divisibility of codes meeting the Griesmer bound
- Divisibility properties and new bounds for cyclic codes and exponential sums in one and several variables
- Weight distributions of linear codes and the Gleason-Pierce theorem
- Divisors of codes of Reed-Muller type
- Heden's bound on the tail of a vector space partition
- Bounds on the minimum distance of the duals of extended BCH codes over \(\mathbb{F}_ p\)
- Generalized \(H\)-codes and doubly even self-dual binary codes
- An introduction to divisible codes
- On strongly walk regular graphs, triple sum sets and their codes
- A bound for divisible codes
- scientific article; zbMATH DE number 1767697 (Why is no real title available?)
- The divisible code bound revisited
- Divisibility of weights for ideals in group algebras
- Binary divisible codes of maximum dimension
- A selection of divisible lexicographic codes
- A class of binary cyclic codes with five weights
- An equivalence of Ward's bound and its application
- Lengths of divisible codes with restricted column multiplicities
- Lengths of divisible codes: the missing cases
- The augmented codes of a family of linear codes with locality 2
- A lemma on binomial coefficients and applications to Lee weights modulo 2e of codes over Z₄
- Further designs for self-orthogonal and LCD codes developed from functions over finite fields
- A family of self-orthogonal divisible codes with locality 2
- Binary t-divisible codes via simplicial complexes and their applications
- Divisibility of Griesmer codes
- Homological origin of the transversal implementability of logical diagonal gates in quantum CSS codes
- A generalized Gleason-Pierce-Ward theorem
- Weight polarization and divisibility
- On a class of abelian codes
This page was built for publication: Divisible codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1142197)