title: Perfect fault tolerance of the n-k-n network.
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.
authors.affiliation: Computer Science and Electrical Engineering Department, University of Maryland Baltimore County, Baltimore, MD 21250, USA. etcher1@umbc.edu
authors.forename: Elko B
authors.initials: EB
authors.lastname: Tchernev
authors.forename: Rory G
authors.initials: RG
authors.lastname: Mulvaney
authors.forename: Dhananjay S
authors.initials: DS
authors.lastname: Phatak
mesh_terms: D016571:Neural Networks, Computer