Connection between primitive generators of GF(2n)

Benjamin Arazi

doi:10.1049/el:19800160

Connection between primitive generators of GF(2ⁿ)

Benjamin Arazi

Department of Electrical & Computer Engineering

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

Primitive polynomials over GF(2) are used for generating maximal-length sequences. Powers of a root a of such a polynomial are delay operators on the generated sequence. Given two primitive polynomials of degree n with α₁, and β₂ their roots, it is shown which parameter is needed in order to find [formula omitted] from [formula omitted] without knowledge of x.

Original language	English
Pages (from-to)	223-225
Number of pages	3
Journal	Electronics Letters
Volume	16
Issue number	6
DOIs	https://doi.org/10.1049/el:19800160
State	Published - 13 Mar 1980

Keywords

Codes
Polynomials
Sequences

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1049/el:19800160

Cite this

@article{01514c3272c34b19bd6a4c411985638b,

title = "Connection between primitive generators of GF(2n)",

abstract = "Primitive polynomials over GF(2) are used for generating maximal-length sequences. Powers of a root a of such a polynomial are delay operators on the generated sequence. Given two primitive polynomials of degree n with α1, and β2 their roots, it is shown which parameter is needed in order to find [formula omitted] from [formula omitted] without knowledge of x.",

keywords = "Codes, Polynomials, Sequences",

author = "Benjamin Arazi",

year = "1980",

month = mar,

day = "13",

doi = "10.1049/el:19800160",

language = "English",

volume = "16",

pages = "223--225",

journal = "Electronics Letters",

issn = "0013-5194",

publisher = "Institution of Engineering and Technology",

number = "6",

}

TY - JOUR

T1 - Connection between primitive generators of GF(2n)

AU - Arazi, Benjamin

PY - 1980/3/13

Y1 - 1980/3/13

N2 - Primitive polynomials over GF(2) are used for generating maximal-length sequences. Powers of a root a of such a polynomial are delay operators on the generated sequence. Given two primitive polynomials of degree n with α1, and β2 their roots, it is shown which parameter is needed in order to find [formula omitted] from [formula omitted] without knowledge of x.

AB - Primitive polynomials over GF(2) are used for generating maximal-length sequences. Powers of a root a of such a polynomial are delay operators on the generated sequence. Given two primitive polynomials of degree n with α1, and β2 their roots, it is shown which parameter is needed in order to find [formula omitted] from [formula omitted] without knowledge of x.

KW - Codes

KW - Polynomials

KW - Sequences

UR - http://www.scopus.com/inward/record.url?scp=0018995363&partnerID=8YFLogxK

U2 - 10.1049/el:19800160

DO - 10.1049/el:19800160

M3 - Article

AN - SCOPUS:0018995363

SN - 0013-5194

VL - 16

SP - 223

EP - 225

JO - Electronics Letters

JF - Electronics Letters

IS - 6

ER -