Do most binary linear codes achieve the Goblick bound on the covering radius?
IEEE Transactions on Information Theory
Epsilon-entropy of an Ellipsoid in a Hamming Space
Problems of Information Transmission
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
Epsilon-entropy of an Ellipsoid in a Hamming Space
Problems of Information Transmission
Problems of Information Transmission
On the Epsilon-entropy of One Class of Ellipsoids in a Hamming Space
Problems of Information Transmission
On the thinnest coverings of spheres and ellipsoids with balls in hamming and euclidean spaces
General Theory of Information Transfer and Combinatorics
| Hi-index | 0.00 |
Asymptotic behavior of the ϵ-entropy of an ellipsoid in a Hamming space is investigated as the dimension of the space grows.