The construction of self-dual normal polynomials over GF(2) and their applications to the Massey-Omura algorithm

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/2013

Full metadata record

DC Field	Value	Language
dc.contributor.author	Rae, A	-
dc.contributor.author	Pathan, M K	-
dc.coverage.spatial	32	en
dc.date.accessioned	2008-04-14T14:13:09Z	-
dc.date.available	2008-04-14T14:13:09Z	-
dc.date.issued	1990	-
dc.identifier.citation	Maths Technical Papers (Brunel University). November 1990, pp 1-29	en
dc.identifier.uri	http://bura.brunel.ac.uk/handle/2438/2013	-
dc.description.abstract	Gaussian periods are used to locate a normal element of the finite field GF(2e) of odd degree e and an algorithm is presented for the construction of self-dual normal polynomials over GF(2) for any odd degree. This gives a new constructive proof of the existence of a self-dual basis for odd degree. The use of such polynomials in the Massey-Omura multiplier improves the efficiency and decreases the complexity of the multiplier	en
dc.format.extent	270103 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en	-
dc.publisher	Brunel University	en
dc.relation.ispartof	Brunel University Mathematics Technical Papers collection;	-
dc.title	The construction of self-dual normal polynomials over GF(2) and their applications to the Massey-Omura algorithm	en
dc.type	Research Paper	en
Appears in Collections:	Dept of Mathematics Research Papers Mathematical Sciences

Files in This Item:

File	Description	Size	Format
TR_13_90.pdf		263.77 kB	Adobe PDF	View/Open