The author studies the structure of linear lexicographic codes over GF(\(p\)) having minimum distance a multipole of \(p\) and all weights divisible by \(p\). Such codes having minimum distance \(p\) and \(2p\) are completely characterized. The codes having minimum distance \(3p\) are more difficult to characterize, and their description involves properties of the prime \(p\). To this end the author introduces the notion of completeness for a prime \(p\). For checking for completeness of primes the author introduces some heuristical methods involving the classes of quadratic residues, the Legendre symbol and quadratic characters. He shows that there are infinitely many complete primes \(p\) congruent to 5 mod 8, He lists the ones below 1000. Furthermore he gives the first 5 primes congruent to 5 mod 8 that are not complete. Finally he lists the complete primes less than 4000. In the last section, the author gives some questions for further research.
- Divisible codes
- On the Lengths of Divisible Codes
- An introduction to divisible codes
- scientific article; zbMATH DE number 1767697
- On the Codes Generated by Certain Divisible Designs
- Divisors of codeword weights
- A bound for divisible codes
- Integral lexicographic codes
- Integral lexicographic codes
- Binary divisible codes of maximum dimension
This page was built for publication: A selection of divisible lexicographic codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q622801)
