×
Jun 22, 2005 · We introduce an extremal problem akin to the search for the parameters of binary linear codes of minimal distance 3 and the largest possible ...
We introduce an extremal problem aldn to the search for the parameters of binary linear codes of minimal distance 3 and the largest possible covering radius ; ...
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 ...
People also ask
Problem: Given n,k ... An Upper Bound on the Covering Radius ρ(C), due to Delsarte (1973) ... Length n = 64: computed the covering radius of 67 extremal.
In the present paper we develop a method to determine the coset weight distributions and covering radius of doubly even self-dual extremal binary codes of ...
On the Covering Radius of Ternary Extremal Self-Dual Codes. In this paper, we investigate the covering radius of ternary extremal self-dual codes. The covering ...
Missing: Problem | Show results with:Problem
In the present paper we develop a method to determine the coset weight distributions and covering radius of extremal ternary self-dual codes of various ...
In the present paper we develop a method to determine the coset weight distributions and covering radius of doubly even self-dual extremal binary codes of ...
Theorem 10 below shows that the covering radius question for R(l, m) is equivalent to an existence problem involving self-complementary bi- nary linear codes.
Zémor: An extremal problem related to the covering radius of binary codes, p. 42 G.L. Katsman: Bounds on covering radius of dual product codes, p. 52. V ...