Perfect Fault Tolerance of the n-k-n Network

Authors:
Elko B. Tchernev;Rory G. Mulvaney;Dhananjay S. Phatak
Affiliations:
Computer Science and Electrical Engineering Department, University of Maryland Baltimore County, Baltimore, MD 21250, U. S. A.;Computer Science and Electrical Engineering Department, University of Maryland Baltimore County, Baltimore, MD 21250, U. S. A.;Computer Science and Electrical Engineering Department, University of Maryland Baltimore County, Baltimore, MD 21250, U. S. A.
Venue:
Neural Computation
Year:
2005

Citing 1
Cited 1

Complete and partial fault tolerance of feedforward neural nets

IEEE Transactions on Neural Networks

Robustness of radial basis functions

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

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.