An improvement of the Van Wee bound for binary linear covering codes

  • Authors:

  • R. Struik

  • Affiliations:

  • Dept. of Math. & Comput. Sci., Eindhoven Univ. of Technol.

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 754.84

Visualization

Abstract

The Van Wee bound gives a lower bound on the cardinality of (block) codes with a prescribed covering radius. The author presents an improvement of this bound for binary linear codes and compares the results with other bounds mentioned in the literature. Almost all reported bounds can be obtained via the present bound as well; moreover, the present authors obtain a number of new lower bounds