Long Extended BCH Codes Are Spanned by Minimum Weight Words

No abstract is available for this paper.

• Publication year

  2006

• Venue

  International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

• Publication date

  2006-02-20

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/11617983_28
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Testing polynomials over general fields

  2004cited by this paper
• Testing low-degree polynomials over prime fields

  2004cited by this paper
• On the Distance Distributions of BCH Codes and Their Duals

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

  2001cited by this paper
• Minimum-weight codewords as generators of generalized Reed-Muller codes

  2000cited by this paper
• Survey of binary Krawtchouk polynomials

  1999cited by this paper
• More on the Distance Distribution of BCH Codes

  1999cited by this paper
• A Low-Weight Trellis-Based Iterative Soft-Decision Decoding Algorithm for Binary Linear Block Codes

  1999cited by this paper
• Bases of Minimum-Weight Vectors for Codes from Designs

  1998cited by this paper
• Linear Programming Bounds for Codes of Small Size

  1997cited by this paper
• The weight distributions of extended binary primitive BCH codes of length 128

  1997cited by this paper
• The Length of Primitive BCH Codes with Minimal Covering Radius

  1997cited by this paper
• More on the covering radius of BCH codes

  1996cited by this paper
• On the traveling salesman problem in binary Hamming spaces

  1996cited by this paper
• On spectra of BCH codes

  1995cited by this paper
• Minimal-change order and separability in linear codes

  1993cited by this paper
• Super-visible codes

  1992cited by this paper
• Studying the locator polynomials of minimum weight codewords of BCH codes

  1992cited by this paper
• An asymptotic bound on the covering radii of binary BCH codes

  1990cited by this paper
• A limit law on the distance distribution of binary codes

  1990cited by this paper
• On the covering radius of long binary BCH codes

  1987cited by this paper
• An approximation to the weight distribution of binary linear codes

  1985cited by this paper
• Algebraic coding theory

  1984cited by this paper
• Inequalities: Theory of Majorization and Its Applications

  1980cited by this paper
• Bounds for Binary Codes Just Outside the Plotkin Range

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

  1977influential reference
• On Generalized Reed-Muller Codes and Their Relatives

  1970cited by this paper
• Sphere-packing in the Hamming metric

  1969cited by this paper

• Some Results on Update Complexity of a Linear Code Ensemble

  2011cites this paper
• Algebraic Property Testing

  2011cites this paper
• Separations of Matroid Freeness Properties

  2010cites this paper
• Succinct Representation of Codes with Applications to Testing

  2009cites this paper
• 1. AES seems weak. 2. Linear time secure cryptography

  2007cites this paper