๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the complexity of generating synchronizable test sequences

โœ Scribed by Lung-Tien Liu; Gen-Huey Chen; Ching-Sung Lu

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
902 KB
Volume
8
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Synchronizable test sequences of finite
Synchronizable test sequences of finite state machines
โœ Kuo-Chung Tai; Yu-Chiou Young ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 180 KB

## ลฝ . The finite state machine FSM model is commonly used for specifying communication protocols and other types of distributed systems. For an FSM with multiple ports, multiple testers are needed, but the synchronization between inputs from different testers becomes a problem. A synchronizable t

On the linear complexity of generalized
On the linear complexity of generalized cyclotomic sequences with the period
โœ Tongjiang Yan; Shengqiang Li; Guozhen Xiao ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 178 KB

This letter contributes to the investigation of the linear complexity of generalized cyclotomic sequences with the period p m , which are contained by the sequences constructed by C. Ding and T. Helleseth in 1998, as a representative special case. The results obtained confirm that all of these seque