scientific article; zbMATH DE number 1996483
The author surveys methods for determining the asymptotic behaviour of fundamental parameters of codes, that is, packings in metric spaces. Both linear and unrestricted codes are studied. The spaces considered are in particular Hamming spaces, Johnson spaces, unit spheres in Euclidean spaces, and Grassman spaces. As the author points out himself, the emphasis is on the general ideas rather than on presenting the best known results in each particular case. This is a nice survey, which contains relevant references -- some of which are rather recent -- for those who want to delve into selected parts of the topic. For the entire collection see [Zbl 1011.00022].
- scientific article; zbMATH DE number 3321829
- Selected unsolved problems in coding theory.
- scientific article; zbMATH DE number 5985497
- Open problems in coding theory
- scientific article; zbMATH DE number 1803256
- On a problem from encoding theory
- Publication:4886131
- scientific article; zbMATH DE number 1104300
- Applications of coding theory to communication combinatorial problems
- Estimating the size of correcting codes using extremal graph problems
- Greedy and heuristic algorithms for codes and colorings
- scientific article; zbMATH DE number 1751828 (Why is no real title available?)
- scientific article; zbMATH DE number 2124565 (Why is no real title available?)
- On Cading and Information Theory
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 Q4432453)