|
Organizers |
Representation Classes of Binary Linear Codes
by
Bob Quackenbush
Univwersity of Manitoba
A class of finite algebras is a representation class if it is closed under direct products and subalgebras. A binary linear code is a finite vector space over GF(2) equipped with a unary operation, ', such that: 0' = 0; x'' = x', and (x + y')' = x' + y'. I will discuss the varieties and representation classes generated by the Hamming codes and the repetition codes and the representation classes determined by the omission of the repetition codes.
Date received: May 17, 2000
Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caee-34.