The equivalence of certain equidistant binary codes and symmetric BIBDS
From MaRDI portal
(Redirected from Publication:761462)
It has been shown that a symmetric BIBD with parameters \((2u^ 2+2u+1,u^ 2,\left( \begin{matrix} u\\ 2\end{matrix} \right))\) implies the existence of maximum size 4k, of an equidistant code of length \(4k+1\) having weight 2k and distance 2k between codewords, for \(k=\left( \begin{matrix} u+1\\ 2\end{matrix} \right)\) and u a positive integer.
Recommendations
Cites work
Cited in
(18)- On balanced complementation for regular t-wise balanced designs
- Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications
- Construction of nested balanced block designs, rectangular designs and \(q\)-ary codes
- On the equivalence of certain constant weight codes and combinatorial designs
- On equidistant constant weight codes
- Equidistant families of sets
- Hamming weight distributions of multi-twisted codes over finite fields
- Symmetric block designs and optimal equidistant codes
- Hamming weight enumerators of multi-twisted codes with at most two non-zero constituents
- Some new results on Hadamard modulo prime matrices
- On equidistant constant weight codes
- On symmetric designs and binary 3-frameproof codes
- New ternary and quaternary constant-weight equidistant codes
- Nested balanced incomplete block designs derivable from simplex codes
- Two series of equitable symbol weight codes meeting the Plotkin bound
- On equidistant binary codes of length \(n=4k+1\) with distance \(d=2k\)
- Good equidistant codes constructed from certain combinatorial designs
- On the construction of q-ary equidistant 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)
