Quasiperfect codes with small distance

No abstract is available for this paper.

• Publication year

  2004

• Venue

  International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.

• Publication date

  2004-06-27

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/ISIT.2004.1365490
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Covering Codes

  2005cited by this paper
• Linear Codes with Covering Radius and Codimension

  2001cited by this paper
• Constructions, families, and tables of binary linear covering codes

  1994cited by this paper
• Constructions for perfect mixed codes and other covering codes

  1993influential reference
• On (k, t) -subnormal covering codes

  1991cited by this paper
• Linear codes with covering radius 2 and other new covering codes

  1991cited by this paper
• Short codes with a given coveting radius

  1989cited by this paper
• A Combinatorial Construction of Perfect Codes

  1983cited by this paper
• The Theory of Error-Correcting Codes

  1977cited by this paper
• New binary codes

  1972cited by this paper
• A Search Technique for Quasi-Perfect Codes

  1966cited by this paper
• Two-Error Correcting Bose-Chaudhuri Codes are Quasi-Perfect

  1960cited by this paper

• No citing papers are available for this paper.