Codes with given distances

@article{Enomoto1987CodesWG,
  title={Codes with given distances},
  author={H. Enomoto and Peter Frankl and Naoharu Ito and K. Nomura},
  journal={Graphs and Combinatorics},
  year={1987},
  volume={3},
  pages={25-38}
}
One of the main results says that ifC is a binary linear code of length 4t and of dimension greater than 2t, thenC contains a word of weight 2t and this bound is best possible. Several results of similar flavor are established both for linear and non-linear codes. For the proof a lemma introducing the binormal forms of binary matrices is needed. The results are applied to determine the coset chromatic number of Hadamard graphs, to solve a problem of Galvin and to give a short proof of a theorem… CONTINUE READING

Topics from this paper.

Similar Papers