A Computer Search for N1L-Configurations

In an earlier paper the author defined N1L configurations, and stated a conjecture concerning them which would lead to an improvement by a constant factor to the sphere-packing bound for linear double error correcting codes. Here a computer search is presented, in an effort to gather evidence on the conjecture.

• Publication year

  2008

• Venue

  arXiv.org

• Publication date

  2008-05-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  arXiv 0805.0173
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Dimensional crossover in Sr$_2$RuO$_4$ within slave-boson mean-field theory

  2008cited by this paper
• CONFIGURATIONS IN BINARY LINEAR CODES

  2007cited by this paper
• Algorithms for classification of combinatorial objects

  2005cited by this paper
• Branch-and-cut for symmetrical ILPs and combinatorial designs

  2004cited by this paper
• Pruning by isomorphism in branch-and-cut

  2001cited by this paper
• On Writing Isomorphism Programs

  1996cited by this paper
• Graph Isomorphism and Identification Matrices: Parallel Algorithms

  1996cited by this paper
• Binary Linear Codes: New Results on Nonexistence

  1996cited by this paper
• Questions Related to the Erdös-Turan Conjecture

  1988cited by this paper
• PARTITION BACKTRACK PROGRAMS : USER ’ S MANUAL

  year unknowncited by this paper

• A CONJECTURE ON N1L CONFIGURATIONS

  2016cites this paper