Search results for "Irreducible"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
119	Sebastian Unger, Frank Mueller 0001	Handling irreducible loops: optimized node splitting versus DJ-graphs.	ACM Trans. Program. Lang. Syst.	2002	DBLP DOI BibTeX RDF	irreducible flowgraphs, reducible flowgraphs, compilation, instruction-level parallelism, Code optimization, loops, control flow graphs, node splitting
111	Francisco Rodríguez-Henríquez, Çetin Kaya Koç	Parallel Multipliers Based on Special Irreducible Pentanomials.	IEEE Trans. Computers	2003	DBLP DOI BibTeX RDF	pentanomials, multipliers for GF(2^m), Finite fields arithmetic, parallel multipliers
88	Grant Pogosyan, Akihiro Nozaki	Join-Irreducible Clones of Multiple-Valued Logic Algebra.	ISMVL	1995	DBLP DOI BibTeX RDF	join-irreducible clones, multiple valued logic algebra, synthetic means, lattice elements, join irreducible elements, unary functions, constructive criteria, graph theoretical property, one variable function, k valued logic, graph theory, set theory, multivalued logic, group theory, monoids, join operation, generating system
77	Kazuhiro Yokoyama, Masayuki Noro, Taku Takeshima	On Factoring Multi-Variate Polynomials over Algebraically Closed Fields (abstract).	ISSAC	1990	DBLP DOI BibTeX RDF
73	Grant Pogosyan, Ivo G. Rosenberg	Generation of the Post Lattice by Irreducible Clones.	ISMVL	2003	DBLP DOI BibTeX RDF
71	Tong Zhang 0002, Keshab K. Parhi	Systematic Design of Original and Modified Mastrovito Multipliers for General Irreducible Polynomials.	IEEE Trans. Computers	2001	DBLP DOI BibTeX RDF	Finite (or Galois) field, standard basis, complexity, multiplication, VLSI architecture, irreducible polynomials, Toeplitz matrix
71	Torsten Minkwitz	Extensions of irreducible representations.	Appl. Algebra Eng. Commun. Comput.	1996	DBLP DOI BibTeX RDF	Irreducible Ordinary Representations, Generalized Fourier Transforms, Group Theory
63	Paul Havlak	Nesting of Reducible and Irreducible Loops.	ACM Trans. Program. Lang. Syst.	1997	DBLP DOI BibTeX RDF	reducible loops, strongly-connected regions
61	Ying Cheng 0006, S. Sitharama Iyengar, Rangasami L. Kashyap	A New Method of Image Compression using Irreducible Covers of Maximum Rectangles.	IEEE Trans. Software Eng.	1988	DBLP DOI BibTeX RDF	irreducible covers, maximal rectangles, concurrent-read-exclusive write, parallel algorithm, parallel algorithms, data structures, data compression, computerised picture processing, image compression, pixels
54	José Luis Imaña, Román Hermida, Francisco Tirado	Low Complexity Bit-Parallel Multipliers Based on a Class of Irreducible Pentanomials.	IEEE Trans. Very Large Scale Integr. Syst.	2006	DBLP DOI BibTeX RDF
54	Juan A. Carrasco	Solving dependability/performability irreducible Markov models using regenerative randomization.	IEEE Trans. Reliab.	2003	DBLP DOI BibTeX RDF
54	Sebastian Unger, Frank Mueller 0001	Handling Irreducible Loops: Optimized Node Splitting vs. DJ-Graphs.	Euro-Par	2001	DBLP DOI BibTeX RDF
54	Toshiya Itoh	Characterization for a Family of Infinitely Many Irreducible Equally Spaced Polynominals.	SIGAL International Symposium on Algorithms	1990	DBLP DOI BibTeX RDF
52	Mikhail Moshkov, Andrzej Skowron, Zbigniew Suraj	On Irreducible Descriptive Sets of Attributes for Information Systems.	RSCTC	2008	DBLP DOI BibTeX RDF	maximal consistent extensions, irreducible descriptive sets, rough sets, information systems
52	Sun-Mi Park, Ku-Young Chang, Dowon Hong	Efficient Bit-Parallel Multiplier for Irreducible Pentanomials Using a Shifted Polynomial Basis.	IEEE Trans. Computers	2006	DBLP DOI BibTeX RDF	shifted polynomial basis, irreducible pentanomial, finite field arithmetic, Bit-parallel multiplier
52	José Luis Imaña, Juan Manuel Sánchez, Francisco Tirado	Bit-Parallel Finite Field Multipliers for Irreducible Trinomials.	IEEE Trans. Computers	2006	DBLP DOI BibTeX RDF	Finite (or Galois) fields, canonical basis, triangular basis, complexity, permutation, multiplication, cycles, matrix decomposition, transpositions, irreducible trinomials
52	Mikhail Ju. Moshkov	On Construction of the Set of Irreducible Partial Covers.	SAGA	2005	DBLP DOI BibTeX RDF	Irreducible partial cover, totally polynomial algorithm
52	Yong Ho Hwang, Sang Gyoo Sim, Pil Joong Lee	Bit-Serial Multipliers for Exponentiation and Division in GF(2m) Using Irreducible AOP.	ICCSA (1)	2004	DBLP DOI BibTeX RDF	Irreducible AOP, Finite field, Exponentiation, Bit-serial multiplier
52	Alper Halbutogullari, Çetin Kaya Koç	Mastrovito Multiplier for General Irreducible Polynomials.	IEEE Trans. Computers	2000	DBLP DOI BibTeX RDF	complexity, Finite fields, multiplication, irreducible polynomials, polynomial basis
50	László Babai, Lajos Rónyai	Computing Irreducible Representations of Finite Groups	FOCS	1989	DBLP DOI BibTeX RDF	deterministic polynomial time, matrices list, randomized polynomial time, Las Vegas polynomial time, generators set, bit complexity, inequivalent irreducible representations, multiplication table, polynomial-size description, absolutely irreducible constituents, polynomial-time algorithm, equivalence class, finite groups, complex numbers, exact computations, algebraic number fields
46	James N. Damon	Tree Structure for Contractible Regions in R3.	Int. J. Comput. Vis.	2007	DBLP DOI BibTeX RDF	Blum medial axis, contractible region, irreducible medial components, essential and inessential fin curves, Y-network, top level and second level (directed) trees
46	Xia Wang, Jianmin Ma	A Novel Approach to Attribute Reduction in Concept Lattices.	RSKT	2006	DBLP DOI BibTeX RDF	partial relation, meet-irreducible element, Concept lattice, attribute reduction
46	Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong	Compact Linear Systolic Arrays for Multiplication Using a Trinomial Basis in GF(2m) for High Speed Cryptographic Processors.	ICCSA (1)	2005	DBLP DOI BibTeX RDF	VLSI, finite field, systolic array, irreducible trinomial
44	Holger Boche, Slawomir Stanczak	A note on some properties of the Perron root of nonnegative irreducible matrices.	Appl. Algebra Eng. Commun. Comput.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 15A48, 94A05
44	Moulay A. Barkatou, Eckhard Pflügel	Computing super-irreducible forms of systems of linear differential equations via moser-reduction: a new approach.	ISSAC	2007	DBLP DOI BibTeX RDF	local analysis of linear differential systems, moser-reduction, super-reduction, computer algebra, singularities
44	Jacques Wolfmann	Are 2-weight projective cyclic codes irreducible?	IEEE Trans. Inf. Theory	2005	DBLP DOI BibTeX RDF
44	Yves Aubry, Philippe Langevin	On the Weights of Binary Irreducible Cyclic Codes.	WCC	2005	DBLP DOI BibTeX RDF
44	Jong-Hak Hwang, Kyung-Jae Moon, Seung-Yong Park, Heung-Soo Kim	A New Construction of the Irreducible Polynomial for parallel multiplier over GF(2m).	ISMVL	2003	DBLP DOI BibTeX RDF	Systolic Multiplier, IPG, Trinomial, Finite Field
44	Grant Pogosyan	Efficiently Irreducible Bases in Multiple-Valued Logic.	ISMVL	1996	DBLP DOI BibTeX RDF	efficiency, completeness, circuit design, logic functions, basis
44	Erich L. Kaltofen	Computing the Irreducible Real Factors and Components of an Algebraic Curve.	SCG	1989	DBLP DOI BibTeX RDF
42	Xia Wang, Wenxiu Zhang	Knowledge Reduction in Concept Lattices Based on Irreducible Elements.	Trans. Comput. Sci.	2009	DBLP DOI BibTeX RDF	irreducible element, attribute characteristic, Concept lattice, knowledge reduction
42	Omran Ahmadi	Self-Reciprocal Irreducible Pentanomials Over F2.	Des. Codes Cryptogr.	2006	DBLP DOI BibTeX RDF	self-reciprocal irreducible polynomials, finite fields
42	Jeffrey S. Olson	Subdirectly Irreducible Residuated Semilattices and Positive Universal Classes.	Stud Logica	2006	DBLP DOI BibTeX RDF	positive universal formulas, subdirectly irreducible algebras, contraction, linear logic, residuated lattices, Residuation
42	Tetsuo Saitou, Mitsugu Suzuki, Tan Watanabe	Dominance analysis of irreducible CFGs by reduction.	ACM SIGPLAN Notices	2005	DBLP DOI BibTeX RDF	dominance frontier, immediate dominator, reduction, control flow graph, dominator tree, irreducible
42	R. Alexander Milowski	Computing irredundant irreducible decompositions of large scale monomial ideals.	ISSAC	2004	DBLP DOI BibTeX RDF	alexander dual, irredundant irreducible decomposition, monomial ideals, scarf complex
42	Marcel Erné, Branimir Seselja, Andreja Tepavcevic	Posets Generated by Irreducible Elements.	Order	2003	DBLP DOI BibTeX RDF	(completely) irreducible, join-dense, completion, poset, complete lattice
42	Arnold Knopfmacher, J. N. Ridley, Gary L. Mullen	Nets and Sequences Obtained from Irreducible Polynomials Over Finite Fields.	Appl. Algebra Eng. Commun. Comput.	1998	DBLP DOI BibTeX RDF	(t, m, s)-net in base b, Finite field, Irreducible Polynomial
42	Igor E. Shparlinski	On irreducible polynomials of small height over finite fields.	Appl. Algebra Eng. Commun. Comput.	1996	DBLP DOI BibTeX RDF	Distribution of prime numbers, Finite fields, Irreducible polynomials
42	W. M. Chu	Construction of irreducible polynomials using cubic transformation.	Appl. Algebra Eng. Commun. Comput.	1995	DBLP DOI BibTeX RDF	Finite fields, irreducible polynomials
38	J. Rafael Sendra, Juana Sendra	Rationality Analysis and Direct Parametrization of Generalized Offsets to Quadrics.	Appl. Algebra Eng. Commun. Comput.	2000	DBLP DOI BibTeX RDF	Offset surfaces, Parametrization, Computer-aided geometric design, Rationality, Quadrics
38	Shreeram S. Abhyankar, Chandrajit L. Bajaj	Automatic parameterization of rational curves and surfaces IV: algebraic space curves.	ACM Trans. Graph.	1989	DBLP DOI BibTeX RDF
37	Anna Maria Bigatti, Eduardo Sáenz-de-Cabezón	Computation of the (n-1)-st Koszul Homology of monomialideals and related algorithms.	ISSAC	2009	DBLP DOI BibTeX RDF	cocoalib, irreducible decomposition, koszul homology, monomial ideal, stanley decomposition, betti numbers
37	Yoshihito Tanaka	An Infinitary Extension of Jankov's Theorem.	Stud Logica	2007	DBLP DOI BibTeX RDF	Subdirectly irreducible algebra, Heyting algebra, Infinitary logic
37	Toshiya Nakajima, Tetsuya Izu, Tsuyoshi Takagi	Reduction Optimal Trinomials for Efficient Software Implementation of the etaT Pairing.	IWSEC	2007	DBLP DOI BibTeX RDF	reduction optimal trinomial, finite field, pairing, irreducible polynomial, software implementation, characteristic three
37	Gui-Lin Zhang, Xiao-Shan Gao	Properties of Ascending Chains for Partial Difference Polynomial Systems.	ASCM	2007	DBLP DOI BibTeX RDF	Ascending chain, coherent chain, regular chain, irreducible chain, partial difference polynomial, characteristic set
37	Haining Fan, Yiqi Dai	Fast Bit-Parallel GF(2^n) Multiplier for All Trinomials.	IEEE Trans. Computers	2005	DBLP DOI BibTeX RDF	Finite field, multiplication, polynomial basis, irreducible trinomial
37	Marcel Erné	Intervals in Lattices of alpha-Meet-Closed Subsets.	Order	2004	DBLP DOI BibTeX RDF	(weakly) atomic, (strongly) coatomic, extremally detachable, meet-closed, interval, prime, semilattice, complete lattice, irreducible
37	Yves Diers	Affine Algebraic Varieties Relative to an Algebraic Theory.	Appl. Categorical Struct.	2001	DBLP DOI BibTeX RDF	affine algebraic variety, irreducible algebra, algebraic theory
35	Chiou-Yng Lee, Jenn-Shyong Horng, I-Chang Jou, Erl-Huei Lu	Low-Complexity Bit-Parallel Systolic Montgomery Multipliers for Special Classes of GF(2m).	IEEE Trans. Computers	2005	DBLP DOI BibTeX RDF	irreducible AOP, finite field, montgomery multiplication, irreducible trinomial, Bit-parallel systolic multiplier
34	Cunsheng Ding	The Weight Distribution of Some Irreducible Cyclic Codes.	IEEE Trans. Inf. Theory	2009	DBLP DOI BibTeX RDF
34	Marta Giorgetti	Interesting Examples on Maximal Irreducible Goppa Codes.	AAECC	2009	DBLP DOI BibTeX RDF
34	Solomon W. Golomb, Pey-Feng Lee	Irreducible Polynomials Which Divide Trinomials Over GF, (2).	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
34	Yde Venema	A Dual Characterization of Subdirectly Irreducible BAOs.	Stud Logica	2004	DBLP DOI BibTeX RDF	Boolean algebras with operators, subdirect irreducibility, duality
34	Solomon W. Golomb, Pey-Feng Lee	Which Irreducible Polynomials Divide Trinomials over GF(2)?	SETA	2004	DBLP DOI BibTeX RDF
34	Grant Pogosyan, Ivo G. Rosenberg	Algebraic Properties of Totally Irreducible Elements of Clone Lattices.	ISMVL	2004	DBLP DOI BibTeX RDF
34	Arturas Dubickas	Polynomials Irreducible by Eisenstein's Criterion.	Appl. Algebra Eng. Commun. Comput.	2003	DBLP DOI BibTeX RDF
34	Ioan Tomescu	On the Maximum Number of Irreducible Coverings of an n -Vertex Graph by n -3 Cliques.	COCOON	2002	DBLP DOI BibTeX RDF
34	Jaemoon Kim, Ikkwon Yie, Seung Ik Oh, Hyung-Don Kim, Jado Ryu	Fast Generation of Cubic Irreducible Polynomials for XTR.	INDOCRYPT	2001	DBLP DOI BibTeX RDF
34	Alper Halbutogullari, Çetin Kaya Koç	Mastrovito Multiplier for General Irreducible Polynomials.	AAECC	1999	DBLP DOI BibTeX RDF
34	Joachim von zur Gathen	Irreducible Polynomials over Finite Fields.	FSTTCS	1986	DBLP DOI BibTeX RDF
32	Victor Shoup	New Algorithms for Finding Irreducible Polynomials over Finite Fields	FOCS	1988	DBLP DOI BibTeX RDF	specified degree, finite fields, polynomial time, irreducible polynomials, deterministic
30	Zhicheng Gao	Improved Error Bounds for the Number of Irreducible Polynomials and Self-Reciprocal Irreducible Monic Polynomials with Prescribed Coefficients over a Finite Field.	AofA	2022	DBLP DOI BibTeX RDF
30	Kondwani Magamba, John A. Ryan	Enumeration of irreducible and extended irreducible Goppa codes.	CoRR	2019	DBLP BibTeX RDF
30	Harald Niederreiter	An Enumeration Formula for Certain Irreducible Polynomials with an Application to the Construction of Irreducible Polynomials over the Binary Field.	Appl. Algebra Eng. Commun. Comput.	1990	DBLP DOI BibTeX RDF
29	Huaming Zhang, Milind Vaidya	On Open Rectangle-of-Influence Drawings of Planar Graphs.	COCOA	2009	DBLP DOI BibTeX RDF
29	Andrew J. Sommese, Charles W. Wampler	Exceptional Sets and Fiber Products.	Found. Comput. Math.	2008	DBLP DOI BibTeX RDF
29	Hari Krovi, Martin Rötteler	An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups.	MMICS	2008	DBLP DOI BibTeX RDF	hidden subgroup problem, coset states, quantum algorithms
29	Jia Li 0023, Xiao-Shan Gao	A Modified Van der Waerden Algorithm to Decompose Algebraic Varieties and Zero-Dimensional Radical Ideals.	ASCM	2007	DBLP DOI BibTeX RDF	zero dimensional variety, irredundant decomposition, resultant, Algebraic variety
29	Adrian Craciun, Madalina Hodorog	Decompositions of Natural Numbers: From a Case Study in Mathematical Theory Exploration.	SYNASC	2007	DBLP DOI BibTeX RDF
29	Joachim von zur Gathen	Counting reducible and singular bivariate polynomials.	ISSAC	2007	DBLP DOI BibTeX RDF	bivariate polynomials, combinatorics on polynomials, reducible polynomials, singular polynomials, finite fields, counting problems
29	Xiao-Shan Gao, Chun-Ming Yuan	Resolvent systems of difference polynomial ideals.	ISSAC	2006	DBLP DOI BibTeX RDF	difference ascending chain, difference polynomial, difference variety, unmixed decomposition, resolvent
29	Kosaku Nagasaka	Towards More Accurate Separation Bounds of Empirical Polynomials II.	CASC	2005	DBLP DOI BibTeX RDF
29	Huapeng Wu	Bit-Parallel Finite Field Multiplier and Squarer Using Polynomial Basis.	IEEE Trans. Computers	2002	DBLP DOI BibTeX RDF	hardware architecture, Finite fields arithmetic, polynomial basis
29	Arash Reyhani-Masoleh, M. Anwarul Hasan	A New Construction of Massey-Omura Parallel Multiplier over GF(2m).	IEEE Trans. Computers	2002	DBLP DOI BibTeX RDF	optimal normal bases, Finite field, Massey-Omura multiplier, all-one polynomial
29	David McSherry	Precision and Recall in Interactive Case-Based Reasoning.	ICCBR	2001	DBLP DOI BibTeX RDF
29	Huapeng Wu	On Complexity of Polynomial Basis Squaring in F2m.	Selected Areas in Cryptography	2000	DBLP DOI BibTeX RDF
29	Huapeng Wu	Low Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis.	CHES	1999	DBLP DOI BibTeX RDF
29	J. Robin B. Cockett, J. A. Hierrera	Decision Tree Reduction	J. ACM	1990	DBLP DOI BibTeX RDF
29	Ravi Sethi	Testing for the Church-Rosser Property.	J. ACM	1974	DBLP DOI BibTeX RDF
27	Jie Fang	Ockham Algebras with Balanced Double Pseudocomplementation.	Stud Logica	2008	DBLP DOI BibTeX RDF	double pseudocomplementation, Ockham algebra, Priestely duality, subdirectly irreducible
27	Guang Zeng, Yang Yang, Wenbao Han, Shuqin Fan	Reducible Polynomial over F2 Constructed by Trinomial sigma-LFSR.	Inscrypt	2008	DBLP DOI BibTeX RDF	Stickelberger-Swan Theorem, ??LFSR, Finite Field, Linear Feedback Shift Register(LFSR), Irreducible Polynomial
27	Jing Liu, Ju-Sheng Mi	A Novel Approach to Attribute Reduction in Formal Concept Lattices.	RSKT	2008	DBLP DOI BibTeX RDF	Meet-irreducible element, Concept lattice, Attribute reduction, Formal context
27	Omran Ahmadi	The trace spectra of polynomial bases for F2n.	Appl. Algebra Eng. Commun. Comput.	2007	DBLP DOI BibTeX RDF	Polynomial bases, Finite fields, Irreducible polynomials
27	Peter Bürgisser, Peter Scheiblechner	Differential forms in computational algebraic geometry.	ISSAC	2007	DBLP DOI BibTeX RDF	differential forms, irreducible components, complexity, connected components
27	Joel Berman, Willem J. Blok	Algebras Defined from Ordered Sets and the Varieties they Generate.	Order	2006	DBLP DOI BibTeX RDF	equationally definable order relation, subdirectly irreducible, Hilbert algebra, order algebra, algebra, ordered set, semilattice, quasi-order, free algebra
27	Haining Fan, M. Anwar Hasan	Relationship between GF(2m) Montgomery and Shifted Polynomial Basis Multiplication Algorithms.	IEEE Trans. Computers	2006	DBLP DOI BibTeX RDF	Montgomery multiplication algorithm, shifted polynomial basis, Finite field, multiplication, polynomial basis, irreducible trinomial
27	R. Padmanabhan, P. Penner	Semilattice Operations Generated by Lattice Terms.	Order	2004	DBLP DOI BibTeX RDF	quasilattice, compatible orders, subdirectly irreducible, distributive multisemilattice, pseudomedian algebras, lattice, semilattice, modular lattice
27	Jun-Cheol Jeon, Kee-Young Yoo	An Evolutionary Approach to the Design of Cellular Automata Architecture for Multiplication in Elliptic Curve Cryptography over Finite Fields.	PRICAI	2004	DBLP DOI BibTeX RDF	Evolutionary Computation, Cellular Automata, Finite Fields, Elliptic Curve Cryptography, Multiplication, Irreducible Polynomial
27	Yasuyuki Nogami, Yoshitaka Morikawa	A Method for Distinguishing the Two Candidate Elliptic Curves in CM Method.	ICISC	2004	DBLP DOI BibTeX RDF	CM method, irreducible cubic polynomial, quadratic power residue/non residue
27	Jan Verschelde	Numerical algebraic geometry and symbolic computation.	ISSAC	2004	DBLP DOI BibTeX RDF	irreducible decomposition, numerical homotopy continuation, polynomial systems, approximate factorization
27	G. Ramalingam	On loops, dominators, and dominance frontiers.	ACM Trans. Program. Lang. Syst.	2002	DBLP DOI BibTeX RDF	irreducible graph, iterated dominance frontier, least common ancestor, loop nesting forest, sparse evaluation, graph transformation, Dominator, loop
27	Sabrina A. Hessinger	Computing the Galois Group of a Linear Differential Equation of Order Four.	Appl. Algebra Eng. Commun. Comput.	2001	DBLP DOI BibTeX RDF	Algebraic Group, Differential Galois Group, Imprimitive, Monomial, Linear Group, Representation, Primitive, Irreducible
27	Branimir Seselja, Andreja Tepavcevic	Collection of Finite Lattices Generated by a Poset.	Order	2000	DBLP DOI BibTeX RDF	finite distributive lattice, finite lattice, meet-irreducible, representation of lattices
27	M. R. Darafsheh, Mohammad Reza Pournaki	Computation of the Dimensions of Symmetry Classes of Tensors Associated with the Finite two Dimensional Projective Special Linear Group.	Appl. Algebra Eng. Commun. Comput.	2000	DBLP DOI BibTeX RDF	Symmetry classes of tensors, Actions of symmetric groups, Irreducible characters, Projective special linear group
27	Clifford Bergman, Giora Slutzki	Computational Complexity of Some Problems Involving Congruences on Algebras.	LICS	2000	DBLP DOI BibTeX RDF	fully invariant, subdirectly irreducible, nondeterministic log-space, nondeterministic polynomial time, congruence, simple
27	G. Ramalingam	Identifying Loops in Almost Linear Time.	ACM Trans. Program. Lang. Syst.	1999	DBLP DOI BibTeX RDF	irreducible flowgraphs, loops
27	Vugranam C. Sreedhar, Guang R. Gao, Yong-Fong Lee	Identifying Loops Using DJ Graphs.	ACM Trans. Program. Lang. Syst.	1996	DBLP DOI BibTeX RDF	DJ graphs, Tarjan's interval, irreducible flowgraphs, reducible flowgraphs, dominator trees
27	Albrecht P. Stroele	Signature analysis and aliasing for sequential circuits.	VTS	1995	DBLP DOI BibTeX RDF	built-in self-test techniques, test registers, subcircuits, irreducible characteristic polynomial, limiting value, fault diagnosis, logic testing, built-in self test, integrated circuit testing, sequential circuits, sequential circuits, aliasing, signature analysis, shift registers, test lengths
27	John R. B. Whittlesey	A comparison of the correlational behavior of random number generators for the IBM 360.	Commun. ACM	1968	DBLP DOI BibTeX RDF	32-bit versus 36-bit word size, IBM 360, congruential generators, digital shift-register generators, linear recurrence modulo two, primitive trinomials modulo two, serial correlation, statistical tests for randomness, random numbers, irreducible polynomials, pseudorandom number generators, prime numbers, autocorrelation function
25	Snehal Udar, Dimitri Kagaris	LFSR Reseeding with Irreducible Polynomials.	IOLTS	2007	DBLP DOI BibTeX RDF