Advertisement

Computational Rules for Binary Word Frequencies of Occurrence

  • Peter W. Becker

Abstract

In this chapter it is assumed that each of the pattern records is time stationary and that a record after sampling and coding constitutes “an adequately long” binary sequence. By “adequately long” is understood a length that permits the computation of each of the interesting binary word frequencies to take place with the desired computational accuracy.

Keywords

Binary Sequence Adequate Length Finite Probability Binary Word Pattern Record 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Peter W. Becker, Copenhagen 1978

Authors and Affiliations

  • Peter W. Becker
    • 1
  1. 1.Electronics LaboratoryTechnical University of DenmarkLyngbyDenmark

Personalised recommendations