Codes from difference sets

This is the first monograph on codebooks and linear codes from difference sets and almost difference sets. It aims at providing a survey of constructions of difference sets and almost difference sets as well as an in-depth treatment of codebooks and linear codes from difference sets and almost difference sets. To be self-contained, this monograph covers necessary mathematical foundations and the basics of coding theory. It also contains tables of best BCH codes and best cyclic codes over GF(2) and GF(3) up to length 125 and 79, respectively. This repository of tables can be used to benchmark newly constructed cyclic codes. This monograph is intended to be a reference for postgraduates and researchers who work on combinatorics, or coding theory, or digital communications.

1. Mathematical foundations. 1.1. Group actions. 1.2. The rings Zn. 1.3. Finite fields. 1.4. Cyclotomy in GF(r). 1.5. Generalized cyclotomy in Zn[symbols]. 1.6. Finite geometries. 1.7. Planar functions. 1.8. Periodic sequences -- 2. Linear codes over finite fields. 2.1. Linear codes. 2.2. Bounds on the size of linear codes. 2.3. Bounds on the size of constant weight codes. 2.4. Cyclic codes over GF(q). 2.5. A combinatorial approach to cyclic codes -- 3. Designs and their codes. 3.1. Incidence structures. 3.2. t-designs and their codes. 3.3. t-adesigns and their codes

6. Linear codes of difference sets. 6.1. Basic theory of linear codes of difference sets. 6.2. Linear codes from Hadamard difference sets. 6.3. Cyclic codes of paley (almost) difference sets. 6.4. Linear codes of Hall difference sets. 6.5. Cyclic codes of cyclotomic (almost) difference sets of order 4. 6.6. Cyclic codes of the two-prime (almost) differenceSets. 6.7. Cyclic codes of Singer difference sets. 6.8. Cyclic codes of the hyperoval difference sets. 6.9. Cyclic codes of the Nk type of difference sets. 6.10. Cyclic codes of Dillon-Dobbertin difference sets. 6.11. Cyclic odes of GMW difference sets. 6.12. Cyclic…