scientific article; zbMATH DE number 1077413
From MaRDI portal
Publication:4360249
zbMath0879.94036MaRDI QIDQ4360249
Publication date: 22 October 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexitypackingdecodingcoveringscardinalitybinary codeerror exponentsVarshamov-Gilbert boundpentagon graph
Linear codes (general theory) (94B05) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) 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)
Related Items (12)
Correlations between the ranks of submatrices and weights of random codes ⋮ Weight distribution moments of random linear/coset codes ⋮ On some punctured codes of ℤq-Simplex codes ⋮ 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 ⋮ Random sphere packing ⋮ Multiple packing in sum-type metric spaces ⋮ Plotkin bound generalization to the case of multiple packings ⋮ BSC reliability function under list decoding ⋮ Lower bound for the linear multiple packing of the binary Hamming space ⋮ Code bounds for multiple packings over a nonbinary finite alphabet ⋮ Multiple Packing in Sum-type Metric Spaces
This page was built for publication:
