Perfect constant-weight codes

Tuvi Etzion, Moshe Schwartz

Research output: Contribution to journalArticlepeer-review

19 Scopus citations

Abstract

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 of parameters as well as specific given parameters.

Original languageEnglish
Pages (from-to)2156-2165
Number of pages10
JournalIEEE Transactions on Information Theory
Volume50
Issue number9
DOIs
StatePublished - 1 Sep 2004
Externally publishedYes

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint

Dive into the research topics of 'Perfect constant-weight codes'. Together they form a unique fingerprint.

Cite this