On covering radius lower bound for a class of binary codes (Q1897944): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:51, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On covering radius lower bound for a class of binary codes |
scientific article |
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
