Citation

Abstract

This article presents three algorithms for forming the Ford sequence of length 2" and compares the storage requirements for each of the three. These sequences are used in checkout of digital communications equipment. Z(n)=— > o(d) 20 n d/n

Details

Volume
IV
Published
August 15, 1971
Pages
84–85
File Size
187.8 KB