On covering radius lower bound for a class of binary codes (Q1897944)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 794590
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On covering radius lower bound for a class of binary codes |
scientific article; zbMATH DE number 794590 |
Statements
On covering radius lower bound for a class of binary codes (English)
0 references
17 September 1995
0 references
The main result is a theorem on doubly exponential limit distribution of the Hamming distance from a random vector to the nearest codeword in a given binary code. From the obtained results lower bounds on the covering radius of certain binary linear codes can be given. The proof of the main result is not given in the paper but in order to give a proof the author claims that he can use a technique suggested in one of the references.
0 references
Hamming distance
0 references
binary code
0 references
lower bounds
0 references
covering radius
0 references
0.8302749991416931
0 references
0.8182618021965027
0 references
0.8170014023780823
0 references
0.8096795678138733
0 references
