✦ LIBER ✦

The complexity of the covering radius problem

✍ Scribed by Venkatesan Guruswami; Daniele Micciancio; Oded Regev

Publisher: Springer
Year: 2005
Tongue: English
Weight: 340 KB
Volume: 14
Category: Article
ISSN: 1016-3328
DOI: 10.1007/s00037-005-0193-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Frobenius Problem and the Covering Radiu

Frobenius Problem and the Covering Radius of a Lattice

✍ Lenny Fukshansky; Sinai Robins 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 225 KB

The complexity of generalized clique cov

The complexity of generalized clique covering

✍ D.G. Corneil; J. Fonlupt 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 670 KB

Improved worst-case complexity for the M

Improved worst-case complexity for the MIN 3-SET COVERING problem

✍ Federico Della Croce; Bruno Escoffier; Vangelis Th. Paschos 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 145 KB

Covering Graphs: The Covering Problem So

Covering Graphs: The Covering Problem Solved

✍ Yair Caro; Raphael Yuster 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 238 KB

For every fixed graph H, we determine the H-covering number of K n , for all n>n 0 (H ). We prove that if h is the number of edges of H, and gcd(H )=d is the greatest common divisor of the degrees of H, then there exists n 0 =n 0 (H ), such that for all n>n 0 , Our main tool in proving this result

On the covering radius of Reed—Solomon c

On the covering radius of Reed—Solomon codes

✍ Arne Dür 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 354 KB

On the covering radius of Reed-Muller co

On the covering radius of Reed-Muller codes

✍ Gérard D. Cohen; Simon N. Litsyn 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 371 KB

We present lower and upper bounds on the covering radius of Reed-Muller codes, yielding asymptotical improvements on known results. The lower bound is simply the sphere covering one (not very new). The upper bound is derived from a thorough use of a lemma, the 'essence of Reed-Mullerity'. The idea