Title :
Constructing SCN bases in characteristic 2
Author_Institution :
IRIT, Univ. Paul Sabatier, Toulouse, France
fDate :
5/1/1995 12:00:00 AM
Abstract :
A simple deterministic algorithm to construct a normal basis of GF(qn) over GF(q) (q=pr, p prime) is given. When p=2, the authors deduce a (self complementary normal-SCN) basis of GF(q n) over GF(q) for n odd, or n=2t, t odd. In characteristic 2 these cases are known to be the only possible ones for which there exists an SCN basis
Keywords :
algorithm theory; deterministic algorithms; matrix decomposition; polynomial matrices; SCN bases; characteristic 2; deterministic algorithm; normal basis; self complementary normal basis; Error correction codes; Gas insulated transmission lines; Hamming weight; Notice of Violation; Protection; Welding;
Journal_Title :
Information Theory, IEEE Transactions on
