A free energy minimization framework for inference problems in modulo 2 arithmetic

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

Volumn 1008, Issue , 1995, Pages 180-195

  Mackay, David J C ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); CRYPTOGRAPHY; FORWARD ERROR CORRECTION; FREE ENERGY; MATRIX ALGEBRA; SHIFT REGISTERS; VECTORS;

COMPUTATIONAL TIME; CORRELATION ATTACK; EMPIRICAL PERFORMANCE; ERROR CORRECTING CODE; FREE ENERGY MINIMIZATION; LINEAR FEEDBACK SHIFT REGISTERS; NOISY OBSERVATIONS; VARIATIONAL FREE ENERGY;

INFERENCE ENGINES;

EID: 84948995395     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60590-8_15     Document Type: Conference Paper

References (18)

1. Aiyer, S. V. B., Niranjan, M. and Fallside, F. (1990). A theoretical investigation into the performance of the Hopfield model, IEEE Trans, on Neural Networks 1(2): 204-215.
2. Anderson, R. J. (1995). Searching for the optimum correlation attack, in B. Preneel (ed.), Fast Software Encryption Lecture Notes in Computer Science, Springer-Verlag, pp. 137-143 (these proceedings).
3. Berlekamp, E. R. (1968). Algebraic Coding Theory, McGraw-Hill, New York.
4. Berlekamp, E. R., McEliece, R. J. and van Tilborg, H. C. A. (1978). On the intractability of certain coding problems, IEEE Transactions on Information Theory 24(3): 384-386.
5. Blake, A. and Zisserman, A. (1987). Visual Reconstruction, MIT Press, Cambridge Mass.
6. Durbin, R. and Willshaw, D. (1987). An analogue approach to the travelling salesman problem using an elastic net method, Nature 326: 689-91.
7. Feynman, R. P. (1972). Statistical Mechanics, W. A. Benjamin, Inc.
8. Gallager, R. G. (1963). Low density parity check codes, number 21 in Research monograph series, MIT Press, Cambridge, Mass.
9. Gee, A. H. and Prager, R. W. (1994). Polyhedral combinatorics and neural networks, Neural Computation 6: 161-180.
10. Tank, D. W. (1985). Neural computation of decisions in optimization problems, Biological Cybernetics 52: 1-25.
11. MacKay, D. J. C. and Neal, R. M. (1995). Error correcting codes using free energy minimization, in preparation.
12. McEliece, R. J. (1978). A public-key cryptosystem based on algebraic coding theory, Technical Report DSN Ą2-ĄĄ, JPL, Pasadena.
13. Meier, W. and Staffelbach, O. (1989). Fast correlation attacks on certain stream ciphers, J. Cryptology 1: 159-176.
14. Mihaljevic, M. J. and Golić, J. D. (1992). A fast iterative algorithm for a shift register initial state reconstruction given the noisy output sequence, Advances in Cryptology - AUSCRYPT'90, Vol. 453, Springer-Verlag, pp. 165-175.
15. Mihaljevic, M. J. and Golić, J. D. (1993). Convergence of a Bayesian iterative error-correction procedure on a noisy shift register sequence, Advances in Cryptology -EUROCRYPT 92, Vol. 658, Springer-Verlag, pp. 124-137.
16. Peterson, C. and Soderberg, B. (1989). A new method for mapping optimization problems onto neural networks, Int. Journal Neural Systems.
17. Peterson, W. W. and Weldon, Jr., E. J. (1972). Error-Correcting Codes, 2nd edn, MIT Press, Cambridge, Massachusetts.
18. Van den Bout, D. E. and Miller, T. K. (1989). Improving the performance of the Hopfield-Tank neural network through normalization and annealing, Biological Cybernetics 62: 129-139.