Coding theory and algebraic combinatorics
From MaRDI portal
Abstract: This chapter introduces and elaborates on the fruitful interplay of coding theory and algebraic combinatorics, with most of the focus on the interaction of codes with combinatorial designs, finite geometries, simple groups, sphere packings, kissing numbers, lattices, and association schemes. In particular, special interest is devoted to the relationship between codes and combinatorial designs. We describe and recapitulate important results in the development of the state of the art. In addition, we give illustrative examples and constructions, and highlight recent advances. Finally, we provide a collection of significant open problems and challenges concerning future research.
Recommendations
Cited in
(9)- scientific article; zbMATH DE number 1924163 (Why is no real title available?)
- Applications of coding theory to communication combinatorial problems
- scientific article; zbMATH DE number 4047170 (Why is no real title available?)
- Combinatorial bounds and characterizations of splitting authentication codes
- Combinatorial vs. algebraic characterizations of completely pseudo-regular codes
- Computational complexity of reconstruction and isomorphism testing for designs and line graphs
- scientific article; zbMATH DE number 3409222 (Why is no real title available?)
- Efficient two-stage group testing algorithms for genetic screening
- Algebraic Coding Theory Over Finite Commutative Rings
This page was built for publication: Coding theory and algebraic combinatorics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3062112)
