Skip to search formSkip to main contentSkip to account menu

Covering code

Known as: Covering, Football pool problem, Football pools problem 
In coding theory, a covering code is a set of elements (called codewords) in a space, with the property that every element of the space is within a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
CodeCoding theoryData compressionDistortion

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Optimal Covering Codes for Finding Near-Collisions
Recently, a new generic method to find near-collisions for cryptographic hash functions in a memoryless way has been proposed… 
Highly Cited
2004
Highly Cited
2004
Cryptography, information theory, and error-correction - a handbook for the 21st century
  • A. Bruen
  • Wiley-Interscience series in discrete mathematics…
  • 2004
  • Corpus ID: 118740876
Preface.I. CRYPTOGRAPHY.1. History and Claude E. Shannon.1.1 Historical Background.1.2 Brief Biography of Claude E. Shannon.1.3… 
2002
2002
Asymmetric Binary Covering Codes
An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Qn such that every vector x ∈ Qn can be… 
1997
1997
Ternary Covering Codes Derived from BCH Codes
It is shown how ternary BCH codes can be lengthened to get linear codes with covering radius 2. The family obtained has the… 
1997
1997
Optimal binary vector quantization via enumeration of covering codes
Binary vector quantization (BVQ) refers to block coding of binary vectors under a fidelity measure. Covering codes were studied… 
1994
1994
Lower Bounds for q-ary Coverings by Spheres of Radius One
1991
1991
On (k, t) -subnormal covering codes
The concept of a (k, t)-subnormal covering code is defined. It is discussed how an amalgamated-direct-sumlike construction can be… 
1987
1987
The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
Highly Cited
1986
Highly Cited
1986
Further results on the covering radius of codes
A number of upper and lower bounds are obtained for K(n, R) , the minimal number of codewords in any binary code of length n and… 
1983
1983
On the Football Pool Problem for 6 Matches: A New Upper Bound
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)