Monthly
288 pp. per issue
6 x 9, illustrated
ISSN
0899-7667
E-ISSN
1530-888X
2014 Impact factor:
2.21

Neural Computation

September 1, 2005, Vol. 17, No. 9, Pages 1911-1920
(doi: 10.1162/0899766054322946)
© 2005 Massachusetts Institute of Technology
Perfect Fault Tolerance of the n-k-n Network
Article PDF (91.48 KB)
Abstract

It was shown in Phatak, Choi, and Koren (1993) that the neural network implementation of the n-k-n encoder-decoder has a minimal size of k = 2, and it was shown how to construct the network. A proof was given in Phatak and Koren (1995) that in order to achieve perfect fault tolerance by replicating the hidden layer, the required number of replications is at least three. In this note, exact lower bounds are derived for the number of replications as a function of n, for the n-2-n network and for the n-log2n-n network.