An extremal problem related to the covering radius of binary codes
G Zémor - Algebraic Coding: First French-Soviet Workshop Paris …, 1992 - Springer
Algebraic Coding: First French-Soviet Workshop Paris, July 22–24, 1991 …, 1992•Springer
We introduce an extremal problem akin to the search for the parameters of binary linear
codes of minimal distance 3 and the largest possible covering radius; we solve the problem
in some cases, give some bounds, and also show how it relates to the construction of good
codes with distance 3.
codes of minimal distance 3 and the largest possible covering radius; we solve the problem
in some cases, give some bounds, and also show how it relates to the construction of good
codes with distance 3.
Abstract
We introduce an extremal problem akin to the search for the parameters of binary linear codes of minimal distance 3 and the largest possible covering radius; we solve the problem in some cases, give some bounds, and also show how it relates to the construction of good codes with distance 3.
Springer
Showing the best result for this search. See all results