Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,690,847 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.
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
2009
2009
From the Editor - Special Cluster on High-Throughput Optimization
J. Chinneck
INFORMS journal on computing
2009
Corpus ID: 13073985
This issue includes a Special Cluster of seven papers on the topic of High-Throughput Optimization. The concept for the cluster…
Expand
2008
2008
Using nearest covering codes to embed secret information in grayscale images
Chinchen Chang
,
T. Kieu
,
Yung-Chen Chou
International Conference on Ubiquitous…
2008
Corpus ID: 18846271
A good visual quality of stego images is an important property of information hiding systems. This can be achieved by reducing…
Expand
2006
2006
An efficient algorithm to rank the partial-sum queries results
Weihua Zhang
,
Shaohua Tan
,
Shiwei Tang
,
Dongqing Yang
International Baltic Conference on Databases and…
2006
Corpus ID: 18290879
In decision-support systems, ranking-aware queries have been gaining much attention recently. In this paper we introduce an…
Expand
2003
2003
New covering codes from an ADS-like construction
M. K. Kaikkonen
,
Petri Rosendahl
IEEE Transactions on Information Theory
2003
Corpus ID: 8656460
A covering code construction is presented. Using this construction it is shown that t[52,39]=3, t[36,21]=4, t[58,32]=7, K(32,2…
Expand
2001
2001
New Constructions of Covering Codes
A. Davydov
Des. Codes Cryptogr.
2001
Corpus ID: 17504554
Coveringcode constructions obtaining new codes from starting ones weredeveloped during last years. In this work we propose new…
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
1997
1997
Optimal binary vector quantization via enumeration of covering codes
Xiaolin Wu
IEEE Transactions on Information Theory
1997
Corpus ID: 28274666
Binary vector quantization (BVQ) refers to block coding of binary vectors under a fidelity measure. Covering codes were studied…
Expand
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)
ACCEPT & CONTINUE