𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Proof of a conjecture of Sarwate and Pursley regarding pairs of binary m-sequences

✍ Scribed by McGuire, G.; Calderbank, A.R.


Book ID
114540213
Publisher
IEEE
Year
1995
Tongue
English
Weight
342 KB
Volume
41
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A Proof of the Welch and Niho Conjecture
✍ Henk D.L. Hollmann; Qing Xiang πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 412 KB

Binary m-sequences are widely applied in navigation, radar, and communication systems because of their nice autocorrelation and cross-correlation properties. In this paper, we consider the cross-correlation between a binary m-sequence of length 2K!1 and a decimation of that sequence by an integer t.

Proof of a conjecture on game domination
✍ O. Favaron; H. Karami; R. Khoeilar; S. M. Sheikholeslami; L. Volkmann πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 87 KB πŸ‘ 1 views

## Abstract The game domination number of a (simple, undirected) graph is defined by the following game. Two players, \documentclass{article}\usepackage{amssymb}\usepackage{amsbsy}\usepackage[mathscr]{euscript}\footskip=0pc\pagestyle{empty}\begin{document}${\mathcal{A}}$\end{document} and \docume

A construction of binary Golay sequence
✍ Jonathan Jedwab; Matthew G. Parker πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 143 KB

## Abstract Binary Golay sequence pairs exist for lengths 2, 10 and 26 and, by Turyn's product construction, for all lengths of the form 2^__a__^10^__b__^26^__c__^ where __a, b, c__ are non‐negative integers. Computer search has shown that all inequivalent binary Golay sequence pairs of length less