اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLow Correlation Sequences from Linear Combinations of Characters
214
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Pairs of binary sequences formed using linear combinations of multiplicative characters of finite fields are exhibited that, when compared to random sequence pairs, simultaneously achieve significantly lower mean square autocorrelation values (for each sequence in the pair) and significantly lower mean square crosscorrelation values. If we define crosscorrelation merit factor analogously to the usual merit factor for autocorrelation, and if we define demerit factor as the reciprocal of merit factor, then randomly selected binary sequence pairs are known to have an average crosscorrelation demerit factor of $1$. Our constructions provide sequence pairs with crosscorrelation demerit factor significantly less than $1$, and at the same time, the autocorrelation demerit factors of the individual sequences can also be made significantly less than $1$ (which also indicates better than average performance). The sequence pairs studied here provide combinations of autocorrelation and crosscorrelation performance that are not achievable using sequences formed from single characters, such as maximal linear recursive sequences (m-sequences) and Legendre sequences. In this study, exact asymptotic formulae are proved for the autocorrelation and crosscorrelation merit factors of sequence pairs formed using linear combinations of multiplicative characters. Data is presented that shows that the asymptotic behavior is closely approximated by sequences of modest length.
قيم البحث
اقرأ أيضاً
Pseudorandom sequences are used extensively in communications and remote sensing. Correlation provides one measure of pseudorandomness, and low correlation is an important factor determining the performance of digital sequences in applications. We co
nsider the problem of constructing pairs $(f,g)$ of sequences such that both $f$ and $g$ have low mean square autocorrelation and $f$ and $g$ have low mean square mutual crosscorrelation. We focus on aperiodic correlation of binary sequences, and review recent contributions along with some historical context.
Graphical passwords (GPWs) are in many areas of the current world. Topological graphic passwords (Topsnut-gpws) are a new type of cryptography, and they differ from the existing GPWs. A Topsnut-gpw consists of two parts: one is a topological structur
e (graph), and one is a set of discrete elements (a graph labelling, or coloring), the topological structure connects these discrete elements together to form an interesting story. Our idea is to transform Chinese characters into computer and electronic equipments with touch screen by speaking, writing and keyboard for forming Hanzi-graphs and Hanzi-gpws. We will use Hanzigpws to produce text-based passwords (TB-paws). We will introduce flawed graph labellings on disconnected Hanzi-graphs.
Let $p$ be any prime. Let $P_n$ be a Sylow $p$-subgroup of the symmetric group $S_n$. Let $phi$ and $psi$ be linear characters of $P_n$ and let $N$ be the normaliser of $P_n$ in $S_n$. In this article we show that the inductions of $phi$ and $psi$ to
$S_n$ are equal if, and only if, $phi$ and $psi$ are $N$--conjugate. This is an analogue for symmetric groups of a result of Navarro for $p$-solvable groups.
Tang and Ding [IEEE IT 67 (2021) 244-254] studied the class of narrow-sense BCH codes $mathcal{C}_{(q,q+1,4,1)}$ and their dual codes with $q=2^m$ and established that the codewords of the minimum (or the second minimum) weight in these codes support
infinite families of 4-designs or 3-designs. Motivated by this, we further investigate the codewords of the next adjacent weight in such codes and discover more infinite classes of $t$-designs with $t=3,4$. In particular, we prove that the codewords of weight $7$ in $mathcal{C}_{(q,q+1,4,1)}$ support $4$-designs when $m geqslant 5$ is odd and $3$-designs when $m geqslant 4$ is even, which provide infinite classes of simple $t$-designs with new parameters. Another significant class of $t$-designs we produce in this paper has supplementary designs with parameters 4-$(2^{2s+1}+ 1,5,5)$; these designs have the smallest index among all the known simple 4-$(q+1,5,lambda)$ designs derived from codes for prime powers $q$; and they are further proved to be isomorphic to the 4-designs admitting the projective general linear group PGL$(2,2^{2s+1})$ as automorphism group constructed by Alltop in 1969.
We classify 8-divisible binary linear codes with minimum distance 24 and small length. As an application we consider the codes associated to nodal sextics with 65 ordinary double points.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
