"A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences over GF(3)"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
Analysis of periodic binary sequences	Jarratt M. Mowery	1986
Periodic Feedback Stabilization for Linear Periodic Evolution Equations	Gengsheng Wang; Yashan Xu	1st ed. 2016	Springer International Publishing
Games of prediction of periodic sequences (U)	Bruno O. Shubert	1971	Naval Postgraduate School
On the distribution of complexity for de Bruijn sequences	Robert LaVern Holdahl	1983	Naval Postgraduate School
A linear time algorithm for finding an ambitus.	B. Mishra	1989	Courant Institute of Mathematical Sciences, New York University
Periodic Character and Patterns of Recursive Sequences	Michael A. Radin	1st ed. 2018	Springer International Publishing
An implementation of the projective algorithm for linear programming	Guenter W. Bretschneider	1985
An algorithm for the solution of linear programming problems	Donald Leroy Sparks	1968	Naval Postgraduate School;Available from National Technical Information Service
Optimal Linear Controller Design for Periodic Inputs	Goele Pipeleers; Bram Demeulenaere; Jan Swevers	2010	Springer London
The Lanczos algorithm for solving symmetric linear systems /	Simon, Horst.	1982.
A geometric algorithm for solving the general linear programming problem.	James Thurber	1958	Courant Institute of Mathematical Sciences, New York University
A fast and simple algorithm for the maximum flow problem	Ravindra K. Ahuja	1987	Sloan School of Management, Massachusetts Institute of Technology
A fast and simple algorithm for the maximum flow problem	Ravindra K. Ahuja	1988	Sloan School of Management, Massachusetts Institute of Technology
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems	Masaru Tomita	1986	Springer US
Linear programming: an explanation of the simplex algorithm	Dakota Ulrich Greenwald	1957	Ronald Press Co.
Convergence properties of an adaptive algorithm for linear threshold elements	Robert R. Pearson	1966	Naval Postgraduate School
Linear Systems of Ordinary Differential Equations With Periodic and Quasi-Periodic Coefficients	Nikolay P. Erugin	1966	Elsevier
An algorithm for noisy function minimization for use in determining optimal trajectories	I. Bert Russak	1987	Naval Postgraduate School
Periodic solutions of a non-linear non-dissipative wave equation.	P. Rabinowitz	1965	Courant Institute of Mathematical Sciences, New York University
The computational complexity of multi-level linear programs	Charles Blair	1989	College of Commerce and Business Administration, Bureau of Economic and Business Research, University of Illinois Urbana-Champaign
Boook	Author(s)	Year	Publisher

Showing 1 to 20 of 100 entries

entries per page

Filter:

Showing 1 to 20 of 100 entries

Chapter	Author(s)	Book	Book Authors	Year	Publisher
A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences	Shimin Wei; Guolong Chen; Guozhen Xiao	Information Security and Cryptology: First SKLOIS Conference, CISC 2005, Beijing, China, December 15-17, 2005, Proceedings	Dengguo Feng; Dongdai Lin; Moti Yung	2005	Springer Berlin Heidelberg
A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences over GF(3)	Jianqin Zhou; Qiang Zheng	Cryptology and Network Security: 5th International Conference, CANS 2006, Suzhou, China, December 8-10, 2006, Proceedings	David Pointcheval; Yi Mu; Kefei Chen	2006	Springer Berlin Heidelberg
Fast Algorithms for Determining the Linear Complexity of Period Sequences	Guozhen Xiao; Shimin Wei	Progress in Cryptology - INDOCRYPT 2002: Third International Conference on Cryptology in India Hyderabad, India, December 16-18, 2002	Alfred Menezes; Palash Sarkar	2002	Springer Berlin Heidelberg
Linear Complexity of Periodic Sequences: A General Theory	James L. Massey; Shirlei Serconek	Advances in Cryptology — CRYPTO ’96: 16th Annual International Cryptology Conference, Santa Barbara, California, USA, August 18–22, 1996, Proceedings	Neal Koblitz	1996	Springer Berlin Heidelberg
Linear Complexity and k-Error Linear Complexity for p n -Periodic Sequences	Wilfried Meidl	Coding, Cryptography and Combinatorics	Keqin Feng; Harald Niederreiter; Chaoping Xing	2004	Birkhäuser Basel
On the k-Operation Linear Complexity of Periodic Sequences	Ramakanth Kavuluru; Andrew Klapper	Progress in Cryptology – INDOCRYPT 2007: 8th International Conference on Cryptology in India, Chennai, India, December 9-13, 2007, Proceedings	K. Srinathan; C. Pandu Rangan; Moti Yung	2007	Springer Berlin Heidelberg
Lower Bounds for the Linear Complexity of Sequences over Residue Rings	Zong-duo Dai; Thomas Beth; Dieter Gollmann	Advances in Cryptology – EUROCRYPT ' 90: Workshop on the Theory and Application of Cryptographic Techniques, Aarhus, Denmark, May 21-24, 1990. Proceedings	Ivan B. Damgard	1991	Springer Berlin Heidelberg
Linear complexity of transformed sequences	Harriet J. Fell	EUROCODE ' 90: International Symposium on Coding Theory and Applications, Udine, Italy, November 5-9, 1990. Proceedings	Gerard Cohen; Pascale Charpin	1991	Springer Berlin Heidelberg
Periodic Sequences with Maximal Linear Complexity and Almost Maximal k-Error Linear Complexity	Harald Niederreiter; Igor E. Shparlinski	Cryptography and Coding: 9th IMA International Conference, Cirencester, UK, December 16-18, 2003, Proceedings	Kenneth G. Paterson	2003	Springer Berlin Heidelberg
Linear Models for High-Complexity Sequences	Sara D. Cardell; Amparo Fúster-Sabater	Computational Science and Its Applications – ICCSA 2017: 17th International Conference, Trieste, Italy, July 3-6, 2017, Proceedings, Part I	Osvaldo Gervasi; Beniamino Murgante; Sanjay Misra; Giuseppe Borruso; Carmelo M. Torre; Ana Maria A.C. Rocha; David Taniar; Bernady O. Apduhan; Elena Stankova; Alfredo Cuzzocrea	1st ed. 2017	Springer International Publishing
A New Algorithm for the k-Error Linear Complexity of Sequences over GF(pm) with Period pn		Sequences and their Applications: Proceedings of SETA '98	C. Ding	1999	Springer London;Imprint;Springer
Linear Complexity and Related Complexity Measures for Sequences	Harald Niederreiter	Progress in Cryptology -- INDOCRYPT 2003: 4th International Conference on Cryptology in India, New Delhi, India, December 8-10, 2003, Proceedings	Thomas Johansson; Subhamoy Maitra	2003	Springer Berlin Heidelberg
Linear Complexity over F p of Ternary Sidel’nikov Sequences	Young-Sik Kim; Jung-Soo Chung; Jong-Seon No; Habong Chung	Sequences and Their Applications – SETA 2006: 4th International Conference, Beijing, China, September 24-28, 2006, Proceedings	Guang Gong; Tor Helleseth; Hong-Yeop Song; Kyeongcheol Yang	2006	Springer Berlin Heidelberg
On the linear complexity of product sequences of linear recurring sequences	G. Morgari; O. Steila; M. Elia	Discrete mathematics and allied topics	Dass, B. K. 1951- [Editor]	2002	Taru Publications;Academic Forum
Cube Theory and Stable \(k\) -Error Linear Complexity for Periodic Sequences	Jianqin Zhou; Wanquan Liu; Guanglu Zhou	Information Security and Cryptology: 9th International Conference, Inscrypt 2013, Guangzhou, China, November 27-30, 2013, Revised Selected Papers	Dongdai Lin; Shouhuai Xu; Moti Yung	2014	Springer International Publishing
The stability of linear complexity of sequences		The Stability Theory of Stream Ciphers	Cunsheng Ding; Guozhen Xiao; Weijuan Shan	1991	Springer Berlin Heidelberg
A Fast Set Intersection Algorithm for Sorted Sequences	Ricardo Baeza-Yates	Combinatorial Pattern Matching: 15th Annual Symposium, CPM 2004, Istanbul, Turkey, July 5-7, 2004, Proceedings	Suleyman C. Sahinalp; S. Muthukrishnan; Ugur Dogrusoz	2004	Springer Berlin Heidelberg
On the Generalized Lauder-Paterson Algorithm and Profiles of the k-Error Linear Complexity for Exponent Periodic Sequences	Takayasu Kaida	Sequences and Their Applications - SETA 2004: Third International Conference, Seoul, Korea, October 24-28, 2004, Revised Selected Papers	Tor Helleseth; Dilip Sarwate; Hong-Yeop Song; Kyeongcheol Yang	2005	Springer Berlin Heidelberg
On the linear complexity of cascaded sequences	Rainer Vogel	Advances in Cryptology: Proceedings of EUROCRYPT 84. A Workshop on the Theory and Application of Cryptographic Techniques - Paris, France, April 9-11, 1984	Thomas Beth; Norbert Cot; Ingemar Ingemarsson	1985	Springer Berlin Heidelberg
A Periodic Sequences		Schaum's Outline of Signals and Systems	Hwei Hsu	1995	McGraw-Hill
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences over GF(3)" - similar Books and Chapters