Code Recognition, Digital Communications, and General Recognition
Clark D. Jeffries · Birkhäuser Boston eBooks · 1991
The memory model of Chapter Three can be used to solve the problem of code recognition. Suppose M binomial n-strings are chosen with components selected from {0,1} (or equivalently from {−1,1}). This amounts to choosing M vertices {m ι }, ι = 1,2,…, M, of the 2 n vertices of the (0,l)-binomial cube in n-dimensional space. Each chosen vertex is called a code word . These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.