﻿<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
	<title>Technical Reports: Recent Comments</title>
	<updated>2012-02-12T00:39:52Z</updated>
	<id>http://techrept.petermmaurer.com/comments/atom.aspx</id>
	<link href="http://techrept.petermmaurer.com/comments/atom.aspx" rel="self" type="application/rss+xml" />
	<link href="http://techrept.petermmaurer.com" rel="alternate" type="application/rss+xml" />
	<generator uri="http://app.onlinequickblog.com/" version="2.6.6">Quick Blogcast</generator>
	<entry>
		<title>Comment on Note: Solutions of a quartic GF(2) polynomial</title>
		<link href="http://techrept.petermmaurer.com/2007/02/01/note-solutions-of-a-quartic-gf2-polynomial.aspx#comment-244339" rel="alternate" type="application/rss+xml" />
		<id>tag:techrept.petermmaurer.com,2007-02-04:244339</id>
		<author>
			<name>Peter M. Maurer</name>
		</author>
		<updated>2007-02-05T03:51:43Z</updated>
		<published>2007-02-05T03:51:43Z</published>
		<content type="html">Sometimes it pays to take look back at the book before exerting a lot of effort. If p is any irreducible polynomial of degree m over GF(2), and a is any root of p, then GF(2^m) has basis vectors 1, a, a^2, ... , a^m-1. Furthermore, the complete list of roots of p is a, a^2, a^4, a^8, ... a^2^i, a^2^m-1. Thus, for every irreducible polynomial p over GF(2) a being a root of p also implies that a^2 is a root of p. Since the roots of p are mathematically indistinguishable, every square of every eigenvalue of a GF(2) matrix is also an eigenvalue of the same matrix.</content>
	</entry>
</feed>
