Perfect constant-weight codes

@article{Etzion2004PerfectCC,
  title={Perfect constant-weight codes},
  author={Tuvi Etzion and Moshe Schwartz},
  journal={IEEE Transactions on Information Theory},
  year={2004},
  volume={50},
  pages={2156-2165}
}
In his pioneering work from 1973, Delsarte conjectured that there are no nontrivial perfect codes in the Johnson scheme. Many attempts were made, during the years which followed, to prove Delsarte's conjecture, but only partial results have been obtained. We survey all these attempts, and prove some new results having the same flavor. We also present a new method, taking a different approach, which we hope can lead to the settling of this conjecture. We show how this new method rules out sets… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 19 references

An algebraic approach to association schemes of coding theory

  • P. Delsarte
  • Philips J. Res., vol. 10, pp. 1–97, 1973.
  • 1973
Highly Influential
10 Excerpts

Perfect codes in graphs

  • E. Biggs
  • J. Combin. Theory Ser. B, vol. 15, pp. 289–296…
  • 1973
Highly Influential
3 Excerpts

Completely regular subsets

  • W. J. Martin
  • Ph.D. dissertation, Univ. Waterloo, Waterloo, ON…
  • 1992
1 Excerpt

Similar Papers

Loading similar papers…