Reliable computations based on locally decodable codes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3884 LNCS, Issue , 2006, Pages 537-548

  Romashchenko, Andrei ^a  

^a UNIV LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN CIRCUIT; FAULT-TOLERANT COMPUTATIONS; MIXING MAPPINGS; PARALLEL COMPUTATION; SUB-LOGARITHMIC BLOW;

COMPUTATIONAL METHODS; COMPUTER SCIENCE; DECODING; ERROR CORRECTION; FAULT TOLERANT COMPUTER SYSTEMS; FUNCTION EVALUATION;

CODES (SYMBOLS);

EID: 33745597574     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11672142_44     Document Type: Conference Paper

References (13)

1. von Neuman, J.: Probabilistic logics and the synthesis of reliable organisms from unreliable components. In C. Shannon and J. McCarthy, editors, Automata Studies. Princeton University Press, 1956.
2. Kuznetsov, A.V.: Information storage in a memory assembled from unreliable components. Problems of Information Transmission. 9:3 (1973) 254-264
3. Dobrushin, R.L. and Ortyukov S.L.: Upper bound for the redundancy of self-correcting arrangement of unreliable functional elements. Problems for Information Transmission, 13:1 (1977) 203-218
4. Dobrushin, R.L. and Ortyukov S.L.: Lower bound on the redundancy of self-correcting arrangement of unreliable functional elements. Problems for Information Transmission, 13:1 (1977) 201-208
5. Pippenger, N.: On Networks of Noisy gates. In Proc. of the 26-th IEEE FOCS Symposium (1985) 30-38
6. Pippenger, N., Stamoulis, G.D., and Tsitsikilis J.N.: On a lower bound on for the redundancy of reliable networks with noisy gates. IEEE Trans. Inform. Theory, 37:3 (1991) 639-643
7. Reischuk, R., and Schmeltz, B.: Reliable computation with noisy circuits and decision trees - a general n log n lower bound. In Proc. of the 32-th IEEE FOCS Symposium (1991) 602-611
8. Gács, P. and Gál, A.: Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates. IEEE Transactions Information Theory. 40 (1994) 579-583
9. Gál, A., and Szegedy, M.: Fault Tolerant Circuits and Probabilistically Checkable proofs. In Proc. of 10th Annual Structure in Complexity Theory Conference (1995) 65-73
10. Spielman, D.A.: Highly fault-Tolerant parallel Computation. Proc. of the 37-th IEEE FOCS Symposium (1996) 154-163
11. Goldreich, A. and Wigderson, A.: Tiny Families of Functions with Random Properties: a Quality-Size Trade-off for Hashing. Random Struct. Algorithms 11:4 (1997) 315-343
12. Reingold, O., Vadhan, S., and Wigderson, A.: Entropy waves, the zig-zag product, and new constant degree expanders. Annals of Mathematics, 155:1 (2002) 157-187
13. Goldreich, O., Karloff, H.J., Schulman, L.J., and Trevisan, L.: Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval. IEEE Conference on Computational Complexity (2002) 175-183