Intersection matrices for partitions by binary perfect codes

No abstract is available for this paper.

• Publication year

  2001

• Venue

  IEEE Transactions on Information Theory

• Publication date

  2001-05-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/18.923749
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Switchings and Perfect Codes

  2000cited by this paper
• On perfect codes and tilings: problems and solutions

  1997cited by this paper
• A GENERAL PRODUCT CONSTRUCTION FOR ERROR CORRECTING CODES

  1984cited by this paper
• Uniformly packed codes

  1976cited by this paper
• On the Mathematical Theory of Error-Correcting Codes

  1959cited by this paper

• Partitions into Perfect Codes in the Hamming and Lee Metrics

  2022cites this paper
• A Partition of the Hypercube into Maximally Nonparallel Hamming Codes

  2012cites this paper
• Cardinality spectra of components of correlation immune functions, bent functions, perfect colorings, and codes

  2012cites this paper
• Cardinality spectra of components of correlation immune functions, bent functions, perfect colorings, and codes

  2012cites this paper
• On construction of vertex-transitive partitions of the n-cube into perfect codes

  2011cites this paper
• On transitive partitions of an n-cube into codes

  2009cites this paper
• On partitions into nonparallel Hamming codes

  2009cites this paper
• Survey of the methods for constructing nonlinear perfect binary codes

  2008cites this paper
• On partitions of an n-cube into nonequivalent perfect codes

  2007cites this paper
• On Intersection Problem for Perfect Binary Codes

  2006cites this paper
• On perfect binary codes

  2005cites this paper