✦ LIBER ✦

A Lower Bound on List Size for List Decoding

✍ Scribed by Guruswami, V.; Vadhan, S.

Book ID: 114642345
Publisher: IEEE
Year: 2010
Tongue: English
Weight: 233 KB
Volume: 56
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2010.2070170

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved lower bounds on the sizes of er

Improved lower bounds on the sizes of error-correcting codes for list decoding

✍ Wei, V.K.; Feng, G.L. 📂 Article 📅 1994 🏛 IEEE 🌐 English ⚖ 578 KB

Combinatorial bounds for list decoding

✍ Guruswami, V.; Hastad, J.; Sudan, M.; Zuckerman, D. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 531 KB

A lower bound for partial list colorings

✍ Chappell, Glenn G. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB 👁 2 views

Let G be an n-vertex graph with list-chromatic number χ . Suppose that each vertex of G is assigned a list of t colors. Albertson, Grossman, and Haas [1] conjecture that at least t n /χ vertices can be colored from these lists. We prove a lower bound for the number of colorable vertices. As a coroll

Bounds on list decoding of MDS codes

✍ Justesen, J.; Hoholdt, T. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 188 KB

A lower bound for randomized list update

A lower bound for randomized list update algorithms

✍ Boris Teia 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 405 KB

A Tight Lower Bound for Online Monotonic

A Tight Lower Bound for Online Monotonic List Labeling

✍ Dietz, Paul F.; Seiferas, Joel I.; Zhang, Ju 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 146 KB