Maximum length cellular automaton sequences and its application

Cited 4 time in webofscience Cited 0 time in scopus
  • Hit : 547
  • Download : 2
In this paper, the maximum length linear binary cellular automaton (CA) sequence is considered. It is shown that all possible maximum length linear binary CA sequences, which are equivalent to maximum length linear binary feedback shift register (LFSR) sequences, can be constructed using linear simple CAs. A table of configurations of the n-cell maximum length simple CAs with its characteristic polynomials is obtained for 76 less than or equal to n less than or equal to 120. An application of the CAs to stream ciphers is indicated. In other applications, a maximum length LFSR may be replaced by a maximum length linear binary CA. (C) 1997 Elsevier Science B.V.
Publisher
ELSEVIER SCIENCE BV
Issue Date
1997-01
Language
English
Article Type
Article
Citation

SIGNAL PROCESSING, v.56, no.2, pp.199 - 203

ISSN
0165-1684
URI
http://hdl.handle.net/10203/5500
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 4 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0