Paper Info
Title
The equivalence of certain equidistant binary codes and symmetric BIBDs.
Abstract
We study equidistant codes of length 4k + 1 having (constant) weight 2k, and (constant) distance 2k between codewords. The maximum number of codewords is 4k; this can be attained if and only ifk = (u 2 +u)/2 (for some integeru) and there exists a ((2u 2 + 2u + 1,u 2, (u 2 −u)/2) — SBIBD. Also, one can construct such a code, with 4k − 1 codewords, from a (4k − 1, 2k − 1,k − 1) — SBIBD.
Year
DOI
Venue
1984
10.1007/BF02579148
Combinatorica
Field
DocType
Volume
Equidistant,Discrete mathematics,Combinatorics,Binary code,Equivalence (measure theory),Code (cryptography),Mathematics
Journal
4
Issue
ISSN
Citations 
4
1439-6912
9
PageRank 
References 
Authors
1.28
2
2
Name
Order
Citations
PageRank
Douglas R. Stinson12387274.83
G. H. John Van Rees2467.64