By Topic

Constructing SCN bases in characteristic 2

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
A. Poli ; IRIT, Univ. Paul Sabatier, Toulouse, France

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

Published in:

IEEE Transactions on Information Theory  (Volume:41 ,  Issue: 3 )