Multilevel sequences in extended Galois fields
- From: "analhaq@xxxxxxxxx" <analhaq@xxxxxxxxx>
- Date: Mon, 26 Mar 2007 17:00:18 +0000 (UTC)
Hello All
I am trying to generate multi-level sequences in extended Galois
fields, GF(4) to be precise, which satisfy the de Bruijn or window
property.
The approach I followed was to use a Linear Shift Register with a
primitive polynomial in GF(4) as teh generator polynomial. But this
requires the primitive polynomials to be generated in the extendef
finite field. For this I could hardly find any fast algortihm. So I
resorted to generating irreducible polynomials ( using the inbuilt
function from the NTL library at http://shoup.net/ntl/) and checking
them for primitivity - by ensuring that they are of maxiaml order.
But this seems to be a costly exercise, since finding out the order
requires 4^degree-1 division checks. ( where degree is the degree of
primitive polynomial to be generated). This requires quite a lot of
time when the degree is more than , say 7. So can somebody suggest a
faster method or atleast some pointers to any algortihm for this.
Thank you in advance
~A
.
- Follow-Ups:
- Re: Multilevel sequences in extended Galois fields
- From: Thomas Womack
- Re: Multilevel sequences in extended Galois fields
- Prev by Date: Re: disproof of Riemann Hypothesis?
- Next by Date: Centers of Perfect Groups
- Previous by thread: Re: disproof of Riemann Hypothesis?
- Next by thread: Re: Multilevel sequences in extended Galois fields
- Index(es):
Relevant Pages
|