The equivalence of certain equidistant binary codes and symmetric BIBDS
From MaRDI portal
Publication:761462
DOI10.1007/BF02579148zbMATH Open0556.05010MaRDI QIDQ761462FDOQ761462
Authors: D. R. Stinson, G. H. J. van Rees 
Publication date: 1984
Published in: Combinatorica (Search for Journal in Brave)
Recommendations
Cites Work
Cited In (18)
- Good equidistant codes constructed from certain combinatorial designs
- Nested balanced incomplete block designs derivable from simplex codes
- Symmetric block designs and optimal equidistant codes
- New ternary and quaternary constant-weight equidistant codes
- Hamming weight enumerators of multi-twisted codes with at most two non-zero constituents
- On the equivalence of certain constant weight codes and combinatorial designs
- Some new results on Hadamard modulo prime matrices
- On balanced complementation for regular t-wise balanced designs
- Hamming weight distributions of multi-twisted codes over finite fields
- Equidistant families of sets
- On equidistant binary codes of length \(n=4k+1\) with distance \(d=2k\)
- Two series of equitable symbol weight codes meeting the Plotkin bound
- On the construction of \(q\)-ary equidistant codes
- Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications
- On symmetric designs and binary 3-frameproof codes
- On equidistant constant weight codes
- On equidistant constant weight codes
- Construction of nested balanced block designs, rectangular designs and \(q\)-ary codes
This page was built for publication: The equivalence of certain equidistant binary codes and symmetric BIBDS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q761462)
