Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,626,801 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Code
Coding theory
Data compression
Distortion
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Covering the Relational Join
Shi Li
,
Sai Vikneshwar Mani Jayaraman
,
A. Rudra
arXiv.org
2020
Corpus ID: 214611957
In this paper, we initiate a theoretical study of what we call the join covering problem. We are given a natural join query…
Expand
2018
2018
N ov 2 01 8 Chain , Generalization of Covering Code , and Deterministic Algorithm for kSAT ∗
2018
Corpus ID: 46907128
We present the current fastest deterministic algorithm for k-SAT, improving the upper bound (2 − 2/k) due to Moser and Scheder in…
Expand
2017
2017
Additive cyclic codes over mixed alphabets and the football pool problem
T. Abualrub
,
N. Aydin
Discret. Math. Algorithms Appl.
2017
Corpus ID: 29667815
Motivated by a generalization of the football pool problem, we introduce additive cyclic codes over mixed alphabets of the form…
Expand
Review
2014
Review
2014
The Book Review Column Algorithms for It That Work in Theory, Algorithms for It That Work in Practice, and Lower Bounds. 2 Books I Need Reviewed for Sigact News Column Algorithms
W. Gasarch
,
Ian Stewart
2014
Corpus ID: 14370660
1. The Universal Computer. The road from Leibniz to Turing by Martin Davis. Reviewed by Haim Kilov. This book has stories of the…
Expand
2011
2011
Adaptive Identification in Torii in the King Lattice
Y. Ben-Haim
,
Sylvain Gravier
,
A. Lobstein
,
Julien Moncel
Electronic Journal of Combinatorics
2011
Corpus ID: 11231849
Given a connected graph $G=(V,E)$, Let $r\geq1$ be an integer and $B_r(v)$ denote the ball of radius $r$ centered at $v\in V$, i…
Expand
2011
2011
Application of sequence hopping and orthogonal covering code for the uplink reference signal
アリス・パパサケラリオウ
,
ジョン・ヤン・チョ
2011
Corpus ID: 64951477
So as to apply to the transmission of; (Reference Signal RS) user terminal (UE;; User Equipment) is orthogonal covering code (OCC…
Expand
2010
2010
Mutation-driven Generation of Oracles and Unit Tests
Gordon Fraser
,
A. Zeller
2010
Corpus ID: 32744211
To assess the quality of test suites, mutation analysis seeds artificial defects (mutations) into programs; a nondetected…
Expand
2007
2007
Lower Bounds for the Football Pool Problem for 7 and 8 Matches
W. Haas
Electronic Journal of Combinatorics
2007
Corpus ID: 17432281
Let $k_3(n)$ denote the minimal cardinality of a ternary code of length $n$ and covering radius one. In this paper we show $k_3(7…
Expand
2003
2003
Understanding Private Information Retrieval Kevin Gimpel Brad Henis Kate Moore CSE 334 Professor :
Sanjeev Khanna December
2003
Corpus ID: 14643104
The problem of private information retrieval arises as a result of the growing need of users to access public databases while…
Expand
1999
1999
The smallest covering code of length 8 and radius 2 has 12 words
U. Blass
,
S. Litsyn
Ars Comb.
1999
Corpus ID: 38526488
We prove that the smallest covering code of length 8 and covering radius 2 has exactly 12 words. The proof is based on partial…
Expand