Divisibility Properties of Some Cyclotomic Sequences

1980 ◽  
Vol 87 (7) ◽  
pp. 561
Author(s):  
J. C. Lagarias ◽  
A. M. Odlyzko
Keyword(s):  
Divisibility Properties ◽  
Cyclotomic Sequences

Divisibility Properties of Some Cyclotomic Sequences

1980 ◽  
Vol 87 (7) ◽  
pp. 561-564
Author(s):  
J. C. Lagarias ◽  
A. M. Odlyzko
Keyword(s):  
Divisibility Properties ◽  
Cyclotomic Sequences

Divisibility Properties of Graded Domains

1982 ◽  
Vol 34 (1) ◽  
pp. 196-215 ◽  
Author(s):  
D. D. Anderson ◽  
David F. Anderson
Keyword(s):  
Integral Domain ◽  
Homogeneous Element ◽  
Carry Over ◽  
Divisibility Properties ◽  
Krull Domains

Let R = ⊕α∊гRα be an integral domain graded by an arbitrary torsionless grading monoid Γ. In this paper we consider to what extent conditions on the homogeneous elements or ideals of R carry over to all elements or ideals of R. For example, in Section 3 we show that if each pair of nonzero homogeneous elements of R has a GCD, then R is a GCD-domain. This paper originated with the question of when a graded UFD (every homogeneous element is a product of principal primes) is a UFD. If R is Z+ or Z-graded, it is known that a graded UFD is actually a UFD, while in general this is not the case. In Section 3 we consider graded GCD-domains, in Section 4 graded UFD's, in Section 5 graded Krull domains, and in Section 6 graded π-domains.

Divisibility Properties of Integers x, k Satisfying 1 k + ⋯+ (x - 1) k = x k

1994 ◽  
Vol 63 (208) ◽  
pp. 799 ◽  
Author(s):  
P. Moree ◽  
H. J. J. Te Riele ◽  
J. Urbanowicz
Keyword(s):  
Divisibility Properties

scholarly journals Divisibility properties in semigroup rings.

1974 ◽  
Vol 21 (1) ◽  
pp. 65-86 ◽  
Author(s):  
Robert Gilmer ◽  
Tom Parker
Keyword(s):  
Semigroup Rings ◽  
Divisibility Properties

scholarly journals Autocorrelation and Linear Complexity of Binary Generalized Cyclotomic Sequences with Period pq

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Yan Wang ◽  
Liantao Yan ◽  
Qing Tian ◽  
Liping Ding
Keyword(s):  
Autocorrelation Function ◽  
Linear Complexity ◽  
Minimal Polynomial ◽  
Binary Sequences ◽  
Cyclotomic Class ◽  
Cyclotomic Sequences ◽  
Autocorrelation Value

Ding constructed a new cyclotomic class V 0   , V 1 . Based on it, a construction of generalized cyclotomic binary sequences with period p q is described, and their autocorrelation value, linear complexity, and minimal polynomial are confirmed. The autocorrelation function C S w is 3-level if p ≡ 3 mod 4 , and C S w is 5-level if p ≡ 1 mod 4 . The linear complexity LC S > p q / 2 if p ≡ 1   mod   8 , p > q + 1 , or p ≡ 3 mod 4 or p ≡ − 3 mod 8 . The results show that these sequences have quite good cryptographic properties in the aspect of autocorrelation and linear complexity.

scholarly journals On the 2-adic order of Stirling numbers of the second kind and their differences

2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Tamás Lengyel
Keyword(s):  
Positive Integer ◽  
Stirling Numbers ◽  
Bell Polynomials ◽  
Binary Representation ◽  
Exact Order ◽  
Special Cases ◽  
International Audience ◽  
The Difference ◽  
Divisibility Properties ◽  
Positive Integers

International audience Let $n$ and $k$ be positive integers, $d(k)$ and $\nu_2(k)$ denote the number of ones in the binary representation of $k$ and the highest power of two dividing $k$, respectively. De Wannemacker recently proved for the Stirling numbers of the second kind that $\nu_2(S(2^n,k))=d(k)-1, 1\leq k \leq 2^n$. Here we prove that $\nu_2(S(c2^n,k))=d(k)-1, 1\leq k \leq 2^n$, for any positive integer $c$. We improve and extend this statement in some special cases. For the difference, we obtain lower bounds on $\nu_2(S(c2^{n+1}+u,k)-S(c2^n+u,k))$ for any nonnegative integer $u$, make a conjecture on the exact order and, for $u=0$, prove part of it when $k \leq 6$, or $k \geq 5$ and $d(k) \leq 2$. The proofs rely on congruential identities for power series and polynomials related to the Stirling numbers and Bell polynomials, and some divisibility properties.

A new class of quaternary generalized cyclotomic sequences of order 2d and length 2pm with high linear complexity

2018 ◽  
Vol 16 (01) ◽  
pp. 1850006 ◽  
Author(s):  
Longfei Liu ◽  
Xiaoyuan Yang ◽  
Bin Wei ◽  
Liqiang Wu
Keyword(s):  
Finite Fields ◽  
Linear Complexity ◽  
Periodic Sequences ◽  
New Class ◽  
New Family ◽  
Generalized Cyclotomic Classes ◽  
Cyclotomic Sequences

Periodic sequences over finite fields, constructed by classical cyclotomic classes and generalized cyclotomic classes, have good pseudo-random properties. The linear complexity of a period sequence plays a fundamental role in the randomness of sequences. In this paper, we construct a new family of quaternary generalized cyclotomic sequences with order [Formula: see text] and length [Formula: see text], which generalize the sequences constructed by Ke et al. in 2012. In addition, we determine its linear complexity using cyclotomic theory. The conclusions reveal that these sequences have high linear complexity, which means they can resist linear attacks.

scholarly journals Divisibility properties of classical binary Kloosterman sums

2009 ◽  
Vol 309 (12) ◽  
pp. 3975-3984 ◽  
Author(s):  
Pascale Charpin ◽  
Tor Helleseth ◽  
Victor Zinoviev
Keyword(s):  
Kloosterman Sums ◽  
Divisibility Properties
Sign in / Sign up

Export Citation Format

Share Document