A selection of divisible lexicographic codes (Q622801): Difference between revisions

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.