๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On a Class of Almost Perfect Sequences

โœ Scribed by K.T. Arasu; S.L. Ma; N.J. Voss


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
210 KB
Volume
192
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

โœฆ Synopsis


Periodic "1 sequences all but one of whose out-of-phase autocorrelation w x coefficients are zero are studied by Wolfmann 9 . Using the equivalence of these ลฝ almost perfect sequences to certain classes of cyclic divisible difference sets as w x. ลฝ noted by Pott and Bradley 7 , we investigate the case s 2 in the terminology of w x. 9 . Sequences of periods 8, 12, and 28 are given and several nonexistence results are obtained. Our results suggest that it is unlikely to have such sequences for periods greater than 28.


๐Ÿ“œ SIMILAR VOLUMES


On a Class of Almost Unbiased Ratio Esti
โœ R. S. Biradar; Dr. H. P. Singh ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 292 KB ๐Ÿ‘ 2 views

## Abstract A class of almost unbiased ratio estimators for population mean ฯƒ is derived by weighting sample ฯƒ = (1/__n__) ฯƒ __y__~__i__~, ratio estimators ฯƒ and an estimator, ฯƒ (__y__~__i__~/__x__~__i__~). It is shown that NIETO DE PASCUAL (1961) estimator is a particular member of the class and a

On a class of kernel-perfect and kernel-
โœ Kiran B. Chilakamarri; Peter Hamburger ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 275 KB

Chilakamarri, K.B. and P. Hamburger, On a class of kernel-perfect and kernel-perfect-critical graphs, Discrete Mathematics 118 (1993) 253-257. In this note we present a construction of a class of graphs in which each of the graphs is either kernel-perfect or kernel-perfect-critical. These graphs or

Constructions of Sequences with Almost P
โœ Chaoping Xing; Harald Niederreiter; Kwok Yan Lam; Cunsheng Ding ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 118 KB

Sequences with almost perfect linear complexity pro"le are of importance for the linear complexity theory of sequences. In this paper we present several constructions of sequences with almost perfect linear complexity pro"le based on algebraic curves over "nite "elds. Moreover, some interesting cons

A class of strongly perfect graphs
โœ M. Preissmann ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 154 KB