scientific article; zbMATH DE number 1077413
From MaRDI portal
Publication:4360249
binary codecardinalitycomplexitycoveringsdecodingerror exponentspackingpentagon graphVarshamov-Gilbert bound
Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Linear codes (general theory) (94B05) Decoding (94B35) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Theory of error-correcting codes and error-detecting codes (94Bxx)
Recommendations
Cited in
(14)- Lower bound for the linear multiple packing of the binary Hamming space
- Random sphere packing
- Code bounds for multiple packings over a nonbinary finite alphabet
- Weight distribution moments of random linear/coset codes
- Multiple Packing in Sum-type Metric Spaces
- On some punctured codes of \(\mathbb{Z}_q\)-simplex codes
- scientific article; zbMATH DE number 3409222 (Why is no real title available?)
- Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius
- Singleton-type bounds for list-decoding and list-recovery, and related results
- Plotkin bound generalization to the case of multiple packings
- BSC reliability function under list decoding
- Correlations between the ranks of submatrices and weights of random codes
- Applications of coding theory to communication combinatorial problems
- Multiple packing in sum-type metric spaces
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 Q4360249)
