Results 11 to 20 of about 160 (120)
Cyclotomy of order 15 over GF(p2), p=4, 11(mod15)
International Journal of Mathematics and Mathematical Sciences, 1986 For primes p≡4, 11(mod15) explicit formulae are obtained for the cyclotomic numbers of order 15 over GF(p2).
Christian Friesen +3 more
doaj +2 more sources
Cyclotomy and Trinomial Equations in a Finite Field. [PDF]
Proc Natl Acad Sci U S A, 1946 Not ...
Vandiver HS.
europepmc +5 more sources
A Kind of Quaternary Sequences of Period 2pmqn and Their Linear Complexity
Complexity, Volume 2020, Issue 1, 2020., 2020 Sequences with high linear complexity have wide applications in cryptography. In this paper, a new class of quaternary sequences over F4 with period 2pmqn is constructed using generalized cyclotomic classes. Results show that the linear complexity of these sequences attains the maximum.
Qiuyan Wang +4 more
wiley +1 more source
Cyclotomy and endomotives [PDF]
P-Adic Numbers, Ultrametric Analysis, and Applications, 2009 52 pages, latex, 2 eps figures, final version to ...
openaire +3 more sources
Linear Complexity of Generalized Cyclotomic Sequences of Order 4 over Fl
Complexity, Volume 2020, Issue 1, 2020., 2020 Generalized cyclotomic sequences of period pq have several desirable randomness properties if the two primes p and q are chosen properly. In particular, Ding deduced the exact formulas for the autocorrelation and the linear complexity of these sequences of order 2. In this paper, we consider the generalized sequences of order 4.
Yuhua Sun +5 more
wiley +1 more source
Cyclotomy and Strongly Regular Graphs [PDF]
Journal of Algebraic Combinatorics, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brouwer, A. E. +2 more
openaire +3 more sources
Difference systems of sets and cyclotomy
Discrete Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yukiyasu Mutoh, Vladimir D. Tonchev
openaire +3 more sources
Search‐based software engineering for constructing covering arrays
IET Software, Volume 12, Issue 4, Page 324-332, August 2018., 2018 Search‐based software engineering involves the application of optimisation methods to solve software engineering problems. One of the most significant difficulties in testing software systems is the effort needed to build the test suites required to validate a software system, which efficiently exposes faults.
Jose Torres-Jimenez +2 more
wiley +1 more source
A generalized formula of Hardy
International Journal of Mathematics and Mathematical Sciences, Volume 17, Issue 2, Page 369-378, 1994., 1994 We give new formulae applicable to the theory of partitions. Recent work suggests they also relate to quasi‐crystal structure and self‐similarity. Other recent work has given continued fractions for the type of functions herein. Hardy originally gave such formulae as ours in early work on gap power series which led to his and Littlewood′s High Indices ...
Geoffrey B. Campbell
wiley +1 more source
Journal of Number Theory, 1982 AbstractLet p be the characteristic of the finite field GF(q), and let e be a divisor of q−1, e≥3. We determine the cyclotomic numbers of order e over GF(q) for the case where −1 is a power of p modulo e. In this case most of the cyclotomic numbers are equal. We also prove a theorem about difference sets.
Baumert, L.D. +2 more
openaire +2 more sources