Home > Cryptology and Network Security: 5th International Conference, CANS 2006, Suzhou, China, December 8-10, 2006, Proceedings > A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences over GF(3)
A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences over GF(3)
Chapter Info
Authors
ARI Id
1664717979392_2898678
Access
Not Available Free
Pages
213-223
DOI
Chapter URL
Table of Contents of Book
Showing 1 to 20 of 28 entries
Chapters/Headings | Author(s) | Pages | Info |
1-18 | |||
19-36 | |||
37-54 | |||
55-72 | |||
73-89 | |||
90-107 | |||
108-125 | |||
126-143 | |||
144-152 | |||
153-167 | |||
168-181 | |||
182-190 | |||
191-202 | |||
203-212 | |||
213-223 | |||
224-240 | |||
241-258 | |||
259-269 | |||
270-285 | |||
Chapters/Headings | Author(s) | Pages | Info |
Showing 1 to 20 of 28 entries
Similar Books
Loading...
Similar Chapters
Loading...
Similar Thesis
Loading...
Similar News
Loading...
Similar Articles
Loading...
Similar Article Headings
Loading...