Results 11  20
of
731
Freeform deformation of solid geometric models
 IN PROC. SIGGRAPH 86
, 1986
"... A technique is presented for deforming solid geometric models in a freeform manner. The technique can be used with any solid modeling system, such as CSG or Brep. It can deform surface primitives of any type or degree: planes, quadrics, parametric surface patches, or implicitly defined surfaces, f ..."
Abstract

Cited by 701 (1 self)
 Add to MetaCart
A technique is presented for deforming solid geometric models in a freeform manner. The technique can be used with any solid modeling system, such as CSG or Brep. It can deform surface primitives of any type or degree: planes, quadrics, parametric surface patches, or implicitly defined surfaces
Quantum complexity theory
 in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM
, 1993
"... Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This constructi ..."
Abstract

Cited by 574 (5 self)
 Add to MetaCart
be implemented and introduce some new, purely quantum mechanical primitives, such as changing the computational basis and carrying out an arbitrary unitary transformation of polynomially bounded dimension. We also consider the precision to which the transition amplitudes of a quantum Turing machine need
A Primitive Polynomial to Define the Finite Field Modules for High Throughput Interpolator to Encode and Decode Of Non Binary Cyclic Codes
"... Abstract: This paper represents The algebraic softdecoding (ASD) of Reed–Solomon (RS) codes provides significant coding gain over harddecision decoding with polynomial complexity. The lowcomplexity chase (LCC) algorithm is proposed for reducing the complexity of interpolation, which interpolates o ..."
Abstract
 Add to MetaCart
Abstract: This paper represents The algebraic softdecoding (ASD) of Reed–Solomon (RS) codes provides significant coding gain over harddecision decoding with polynomial complexity. The lowcomplexity chase (LCC) algorithm is proposed for reducing the complexity of interpolation, which interpolates
On the construction of bent functions of 2k variables from a primitive polynomial of degree k
, 2007
"... Starting with a basis of F2k2, we define some sets in F2k2 that are the supports of bent functions of 2k variables. We also establish some results in order to count the number of bent functions we can construct, and we provide a complete classification of all bases of F2k2 (for k = 2) providing the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Starting with a basis of F2k2, we define some sets in F2k2 that are the supports of bent functions of 2k variables. We also establish some results in order to count the number of bent functions we can construct, and we provide a complete classification of all bases of F2k2 (for k = 2) providing the same supports of bent functions.
ABSTRACT TESTING PRIMITIVE POLYNOMIALS FOR GENERALIZED FEEDBACK SHIFT REGISTER RANDOM NUMBER GENERATORS
, 2005
"... of a project submitted by ..."
Table of primitive binary polynomials
 Math. Comp
, 1994
"... For those n < 5000, for which the factorization of 2 n − 1 is known, the first primitive trinomial (if such exists) and a randomly generated primitive 5 – and 7–nomial of degree n in GF(2) are given. A primitive polynomial of degree n over GF(2) is useful for generating a pseudo–random sequence o ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
For those n < 5000, for which the factorization of 2 n − 1 is known, the first primitive trinomial (if such exists) and a randomly generated primitive 5 – and 7–nomial of degree n in GF(2) are given. A primitive polynomial of degree n over GF(2) is useful for generating a pseudo–random sequence
On Primitivity Tests for Polynomials
 In Proceedings of the 1998 IEEE International Symposium on Information Theory
, 1998
"... This paper considers algorithms for primitivity tests of polynomials over finite fields. The algorithms are optimized for the case that the polynomials tested turn out to be primitive. As the main contribution, we suggest a careful selection among many known algorithms for exponentiation. The result ..."
Abstract
 Add to MetaCart
This paper considers algorithms for primitivity tests of polynomials over finite fields. The algorithms are optimized for the case that the polynomials tested turn out to be primitive. As the main contribution, we suggest a careful selection among many known algorithms for exponentiation
Almost Irreducible and Almost Primitive Trinomials
 in Primes and Misdemeanours: Lectures in Honour of the Sixtieth Birthday of Hugh Cowie Williams, Fields Institute
, 2003
"... Consider polynomials over GF(2). We de ne almost irreducible and almost primitive polynomials, explain why they are useful, and give some examples and conjectures relating to them. 2 ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Consider polynomials over GF(2). We de ne almost irreducible and almost primitive polynomials, explain why they are useful, and give some examples and conjectures relating to them. 2
Tables of Linear Cellular Automata for Minimal Weight Primitive
"... This technical report contains a table of linear cellular automata for certain primitive polynomials. For each degree from two to 300, the table lists a primitive polynomial of minimal weight (least possible number of nonzero coefficients), and its corresponding cellular automaton. ..."
Abstract
 Add to MetaCart
This technical report contains a table of linear cellular automata for certain primitive polynomials. For each degree from two to 300, the table lists a primitive polynomial of minimal weight (least possible number of nonzero coefficients), and its corresponding cellular automaton.
Results 11  20
of
731