Guessing more secrets via list decoding

Internet Mathematics

Volumn 2, Issue 1, 2005, Pages 21-30

  Razborov, Alexander A ^a,b  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 36448949742     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2005.10129099     Document Type: Article

References (7)

1. N. Alon, V. Guruswami, T. Kaufman, and M. Sudan. “Guessing Secrets Efficiently via List-Decoding.” In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 254–262. Philadelphia: SIAM, 2002.
2. F. Chung, R. Graham, and T. Leighton. “Guessing Secrets.” Electronic Journal of Combinatorics 8:1 (2001), R13.
3. F. Chung, R. Graham, and L. Lu. “Guessing Secrets with Inner Product Questions.” In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 247–253. Philadelphia: SIAM, 2002.
4. V. Guruswami and M. Sudan. “Improved Decoding of Reed-Solomon Codes and Algebraic-Geometry Codes.” IEEE Transactions on Information Theory 45:6 (1999), 1757–1767.
5. D. Micciancio and N. Segerlind. Using Hypergraph Homomorphisms to Guess Three Secrets. Manuscript, 2004.
6. I. Peterson. “Guessing Secrets.” Science News 161:14 (2002), 216.
7. Z. Tuza. “Critical Hypergraphs and Intersecting Set-Pair Systems.” Journal of Combinatorial Theory, Ser. B 39 (1985), 134–145.