✦ LIBER ✦

Orthogonal Arrays, Primitive Trinomials, and Shift-Register Sequences

✍ Scribed by Akihiro Munemasa

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 271 KB
Volume: 4
Category: Article
ISSN: 1071-5797
DOI: 10.1006/ffta.1998.0213

No coin nor oath required. For personal study only.

✦ Synopsis

We investigate properties of maximum-length binary shift-register sequences defined by primitive trinomials. We consider the set of subintervals of length n of such a sequence for m(n42m#1, where m is the degree of the trinomial. This set is an orthogonal array of strength 2 and is shown to have a property very close to being an orthogonal array of strength 3.

📜 SIMILAR VOLUMES

Quasi-synchronous code division multiple

Quasi-synchronous code division multiple access (CDMA) with binary shift-register sequences

✍ Seiji Kuno; Takaya Yamazato; Masaaki Katayama; Akira Ogawa 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 845 KB

A real-valued periodic orthogonal sequen

A real-valued periodic orthogonal sequence derived from a real-valued shift-orthogonal finite-length sequence and its fast periodic correlation algorithm

✍ Takahiro Matsumoto; Yoshihiro Tanada 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 551 KB