A simple proof of the improved Johnson bound for binary codes (Q4968646)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A simple proof of the improved Johnson bound for binary codes |
scientific article; zbMATH DE number 7080987
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple proof of the improved Johnson bound for binary codes |
scientific article; zbMATH DE number 7080987 |
Statements
16 July 2019
0 references
binary code
0 references
Johnson bound
0 references
upper bound
0 references
A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES (English)
0 references
0.8423017859458923
0 references
0.8039403557777405
0 references
0.7995411157608032
0 references
0.7939659953117371
0 references
