scientific article; zbMATH DE number 1767697
This paper is a survey on divisible codes and some of their properties. In section 1 the author gives a brief introduction to linear codes following an approach by Assmus and Mattson. A central notion is that of a divisible code, defined as a code for which every codeword has a weight divisible by some constant \(\Delta\). Section 2 is devoted to generalized Reed-Muller codes. Central results discussed here are the theorems of Ax and McEliece. Section 3 deals with the divisible code bound and divisibility properties of self-dual codes. The author states a divisible code version of the Gleason-Pearce theorem. The divisible code bound leads to a nice result by the author: Proposition 8. For a given constant \(\delta>1\), consider \([n,k]_q\) codes that are divisible by \(\Delta\) and for which \(k>n/\delta\). Then \(\Delta\) is bounded; and if \(\Delta>\delta\), then \(q\) is also bounded. Section 4 deals with optimal linear codes in the sense of the Griesmer bound. A central result in this section is the following. Theorem 9. Let \(C\) be a Griesmer code over \(GF(p)\), \(p\) a prime. Then if \(p^e\) divides the minimum weight, \(p^e\) is a divisor of the code. Possible generalizations to this theorem are discussed. The author states one such conjecture and proves it for the case of \(q=4\).
- An introduction to divisible codes
- On the Lengths of Divisible Codes
- A bound for divisible codes
- The divisible code bound revisited
- Divisible codes
- On the Codes Generated by Certain Divisible Designs
- Divisors on division algebras and error correcting codes
- Divisors of codes of Reed-Muller type
- A Generalization of the Cylinder Conjecture for Divisible Codes
- A rational periodicity theorem for division codes
- Classification of Griesmer codes and dual transform
- Divisible codes
- Divisibility properties and new bounds for cyclic codes and exponential sums in one and several variables
- An introduction to divisible codes
- The \([46, 9, 20]_2\) code is unique
- Divisible arcs, divisible codes, and the extension problem for arcs and codes
- A geometric approach to classifying Griesmer codes
- Some hypersurfaces over finite fields, minimal codes and secret sharing schemes
- Half plane models for divides, their knots and Dowker-Thistlethwaite codes
- A bound for divisible codes
- On the Codes Generated by Certain Divisible Designs
- Intersection sets, three-character multisets and associated codes
- A Ward type bound for additive divisible codes over finite abelian groups and its application
- The divisible code bound revisited
- On the non-existence of a projective \((75, 4, 12, 5)\) set in \(\mathrm{PG}(3, 7)\)
- Divisibility of weights for ideals in group algebras
- On regular sets of affine type in finite Desarguesian planes and related codes
- A selection of divisible lexicographic codes
- Structure of functional codes defined on non-degenerate Hermitian varieties
- Lengths of divisible codes with restricted column multiplicities
- Locally two-weight property for linear codes and its application
- Nonexistence of some four dimensional linear codes attaining the Griesmer bound
- Lengths of divisible codes: the missing cases
- A conjecture on the minimum length of linear codes over finite fields
- 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
- New families of SOD and LCD codes, and LRCs based on plateaued functions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4538683)