Code Recognition, Digital Communications, and General Recognition

  • Clark Jeffries
Part of the Mathematical Modeling book series (MMO, volume 7)


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.


Digital Communication Memory Model Code Word Noise Voltage Gain Function 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Birkhäuser Boston 1991

Authors and Affiliations

  • Clark Jeffries
    • 1
  1. 1.Department of Mathematical SciencesClemson UniversityClemsonUSA

Personalised recommendations