maximum-length LFSRs

Article View: comp.lsi.testing

Article #103

#103

From: Chuck Shavit
Date: Fri, 18 Dec 1992 22:08

15 lines
700 bytes

Dear Netters,

I am looking for an algorithm to compute a primitive polynomial of a Linear
Feedback Shift Register.  A primitive polynomial is a polynomial that cause
an n-bit LFSR to generate a sequence 2**n-1 different numbers (usually
there are many such polynomials for a given n; I am interested in just
one...).

Thanks,

Chuck Shavit
Kendall Square Research

chuck@ksr.com

Technical Details

Message-ID: <20246@ksr.com>

Path: arc1-ca.pugleaf.net!sparky!uunet!world!ksr!chuck

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!sparky!uunet!world!ksr!chuck
From: chuck@ksr.com (Chuck Shavit)
Newsgroups: comp.lsi.testing
Subject: maximum-length LFSRs
Message-ID: <20246@ksr.com>
Date: 18 Dec 92 17:08:26 EST
Sender: news@ksr.com
Distribution: comp.lsi.testing
Organization: Kendall Square Research Corp.
Lines: 15