找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Sequences and their Applications; Proceedings of SETA T. Helleseth,P. V. Kumar,K. Yang Conference proceedings 2002 Springer-Verlag London

[复制链接]
楼主: 畸齿矫正学
发表于 2025-3-26 22:44:39 | 显示全部楼层
发表于 2025-3-27 03:55:38 | 显示全部楼层
Cyclic Projective Planes, Perfect Circular Rulers, and Good Spanning Rulersif these distinct differences are the consecutive integers from 1 to (.), occurring in any order. Two proofs are given that there are no perfect spanning rulers when . > 4. The length of the shortest spanning ruler with . marks, denoted .(.), has now been determined by exhaustive computer search for
发表于 2025-3-27 06:32:07 | 显示全部楼层
Linear Recursive Sequences over Elliptic Curvessequences obtained from these LFSR sequences. The former is called .. Properties on representation, period, and linear span of these two types of sequences are discussed. Also, the even case for the elliptic curve sequence proposed in [5] is analysed.
发表于 2025-3-27 11:14:54 | 显示全部楼层
On the Distinctness of Decimations of ℓ-Sequencesty that the arithmetic correlations between any two cyclically distinct decimations are precisely zero. It is open, however, whether all such pairs of decimations are indeed cyclically distinct. In this paper we show that a .-fold decimation of an ℓ-sequence with prime connection number q is cyclica
发表于 2025-3-27 17:26:17 | 显示全部楼层
On Binary Sequences of Period n = pm ∓ 1 with Optimal Autocorrelationl (. + 1). +.. + . over the finite field . of .. elements. It was shown in [4] that they are (almost) balanced and have optimal autocorrelation in the case where the polynomial can be transformed into the form .. − .. In this paper, we show that the sequences are (almost) balanced and have optimal a
发表于 2025-3-27 18:13:45 | 显示全部楼层
发表于 2025-3-27 22:33:18 | 显示全部楼层
发表于 2025-3-28 02:59:45 | 显示全部楼层
First-Order Optimal Approximation of Binary Sequencesd and three methods are presented: the sequential divisions method, the congruential equations method and the phase synchronization method. High level algorithm organizations are provided. Finally, guidelines on sequence characterization and design via the notion of robustness are given.
发表于 2025-3-28 08:22:34 | 显示全部楼层
发表于 2025-3-28 12:47:10 | 显示全部楼层
New p-ary Perfect Sequences and Difference Sets with Singer Parametersre .. is the invertible linear map ., are also difference sets; and we modulate the functions .. defined by . to obtain p-ary functions .. whose corresponding sequences {..(..)}, . primitive in GF(p.)., have ideal autocorrelation.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-20 07:17
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表