New Constant-Weight Codes From Propagation Rules

This paper proposes some simple propagation rules which give rise to new binary constant-weight codes.

• Publication year

  2010

• Venue

  IEEE Transactions on Information Theory

• Publication date

  2010-04-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/TIT.2010.2040964arXiv 1008.1610
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Limit on the Addressability of Fault-Tolerant Nanowire Decoders

  2009cited by this paper
• The characterization of binary constant weight codes meeting the bound of Fu and Shen

  2007cited by this paper
• A geometric approach to finding new lower bounds of A(n, d, w)

  2007cited by this paper
• New Optimal Constant Weight Codes

  2007cited by this paper
• A New Lower Bound for A(17, 6, 6)

  2007cited by this paper
• Heuristic construction of constant weight binary codes

  2007cited by this paper
• Resistor-logic demultiplexers for nanoelectronics based on constant-weight codes

  2006cited by this paper
• Asymptotic Determination of the Last Packing Number of Quadruples

  2006cited by this paper
• A New Table of Constant Weight Codes of Length Greater than 28

  2006cited by this paper
• A Lower Bound on the Probability of Undetected Error for Binary Constant Weight Codes

  2005cited by this paper
• A construction of binary constant-weight codes from algebraic curves over finite fields

  2005cited by this paper
• Perfect constant-weight codes

  2004cited by this paper
• Coding Theory: A First Course

  2004cited by this paper
• Coding Theory: Index

  2004cited by this paper
• Nanowire Crossbar Arrays as Address Decoders for Integrated Nanosystems

  2003cited by this paper
• Six New Constant Weight Binary Codes

  2003cited by this paper
• EXTREMAL PROBLEMS OF CODING THEORY

  2002cited by this paper
• Upper bounds for constant-weight codes

  2000cited by this paper
• A new table of constant weight codes

  1990cited by this paper
• Lower bounds for constant weight codes

  1980cited by this paper
• Two dual families of nonlinear binary codes

  1974cited by this paper
• Upper bounds for constant weight error correcting codes

  1972cited by this paper
• A Class of Optimum Nonlinear Double-Error-Correcting Codes

  1968cited by this paper
• On A Class of Error Correcting Binary Group Codes

  1960influential reference

• Automated Discovery of Improved Constant Weight Binary Codes

  2026cites this paper
• The dimensions of Galois hulls of linear codes derived from an improved propagation rule and related applications

  2025cites this paper
• The Hull of Two Classical Propagation Rules and Their Applications

  2022cites this paper
• Heuristics for the Generalized Graph Coloring Problem

  2021cites this paper
• Optimal binary constant weight codes and affine linear groups over finite fields

  2017cites this paper
• New explicit binary constant weight codes from Reed-Solomon codes

  2015cites this paper
• Meeting Your Neighbours

  2011cites this paper
• Source and channel coding algorithms using rabbit (Golden) sequence terms

  2011cites this paper