Abstract
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 2n vertices of the (0,l)-binomial cube in n-dimensional space. Each chosen vertex is called a code word.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Birkhäuser Boston
About this chapter
Cite this chapter
Jeffries, C. (1991). Code Recognition, Digital Communications, and General Recognition. In: Jeffries, C. (eds) Code Recognition and Set Selection with Neural Networks. Mathematical Modeling, vol 7. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-3216-2_5
Download citation
DOI: https://doi.org/10.1007/978-1-4612-3216-2_5
Publisher Name: Birkhäuser Boston
Print ISBN: 978-1-4612-7836-8
Online ISBN: 978-1-4612-3216-2
eBook Packages: Springer Book Archive