Elsevier

Discrete Mathematics

Volume 97, Issues 1–3, 10 December 1991, Pages 155-160
Discrete Mathematics

On the maximum cardinality of binary constant weight codes with prescribed distance

In memory of Egmont Köhler.
https://doi.org/10.1016/0012-365X(91)90430-AGet rights and content
Under an Elsevier user license
open archive

Abstract

Let A(n, d, w) be the maximum cardinality of a binary code with length n, constant weight w (0 ⩽ w ⩽ ⌊n/2⌋) and Hamming distance d. In this paper a method is discussed in order to determine upper bounds for A(n, d, w), combining ideas from Delsarte (1973), Johnson (1972) and de Vroedt (1980).

Cited by (0)