Results 31 to 40 of about 160 (120)
On the linear complexity of a new generalized cyclotomic sequence with length mover GF(h)
Based on the Ding-generalized cyclotomy,a new class of generalized cyclotomic sequences with length pm over the finite field of power of odd prime order was constructed,and the sequence was balanced.The linear complexity of the sequences was determined ...
Long-fei LIU, Kai YANG, Xiao-yuan YANG
doaj +2 more sources
Cyclotomy and delta units [PDF]
In this paper we examine cyclic cubic, quartic, and quintic number fields of prime conductor p containing units that bear a special relationship to the classical Gaussian periods:
openaire +2 more sources
Quantum Synchronizable Codes on Sextic Cyclotomy
Quantum Synchronizable, Sextic cyclotomy, Cyclic ...
Tao Wang, Tongjiang Yan, Xueting Wang
openaire +3 more sources
Almost Difference Sets from Unions of Cyclotomic Classes of Order 10
This study investigated the problem of constructing almost difference sets from single and unions of cyclotomic classes of order 10 (with and without zero) of the finite field GF(q), where q is a prime of the form q = 10n+1 for integer n≥1 and ...
Benedict Estrella
doaj +1 more source
Balanced ternary and quaternary sequence pairs of odd period with three-level correlation
Sequence pairs with good correlation have wide applications in communication systems. In this paper, ternary and quaternary sequence pairs of odd period with three-level correlation are constructed based on cyclotomy.
Lianfei Luo, Wenping Ma
doaj
On the Stability of the Linear Complexity of Some Generalized Cyclotomic Sequences of Order Two
Linear complexity is an important pseudo-random measure of the key stream sequence in a stream cipher system. The 1-error linear complexity is used to measure the stability of the linear complexity, which means the minimal linear complexity of the new ...
Chi Yan, Chengliang Tian
doaj +1 more source
Quantum integers and cyclotomy
A sequence of functions {f_n(q)}_{n=1}^{\infty} satisfies the functional equation for multiplication of quantum integers if f_{mn}(q) = f_m(q)f_n(q^m) for all positive integers m and n. This paper describes the structure of all sequences of rational functions with rational coefficients that satisfy this functional equation.
Borisov, Alexander O. +2 more
openaire +4 more sources
The rising demand for diverse service requirements under limited resources necessitates designing codeword indicators with variable distance metrics to exploit prior information, such as data rate, coding schemes, and Signal-to-Noise Ratio (SNR ...
Zhifan Ye, Yapeng Gao, Liuguo Yin
doaj +1 more source
A class of almost r-phase sequences with ideal autocorrelation
For an odd prime N 1 (mod r), (r) almost r-phase sequences of period N areconstructed based on cyclotomy, where r is a positive integer and is Euler’sfunction. The new sequences have ideal autocorrelation property. Moreover, thesealmost r-phase sequences
Shenghua Li, Lianfei Luo, Hannuo Zhao
doaj
Debruijn Sequences, Irreducible Codes and Cyclotomy
A de Bruijn sequence of order \(n\) is a binary sequence with period \(2^n\) which contains all binary \(n\)-tuples. They are defined by nonlinear feedback functions. The most of the algorithms for generating de Bruijn sequences are variants of the cycle join algorithms (CJA).
Erik R. Hauge, Tor Helleseth
openaire +2 more sources

