Binary Self-Complementary Codes

Show simple item record

dc.contributor.author Asemota, Ifeyinwa
dc.date.accessioned 2016-09-30T22:33:07Z
dc.date.available 2016-09-30T22:33:07Z
dc.date.copyright 2016 en_US
dc.date.issued 2016-09-30
dc.identifier.uri http://hdl.handle.net/1828/7583
dc.description.abstract A binary linear code C is said to be self-complementary if the all-ones codeword belongs to C. This report focuses on binary self-complementary codes and their weight distributions which in some cases are generated using the MAGMA Computational Algebra System. Several classes of binary codes, namely Hamming, simplex, single parity check, repetition, extended Hamming and Reed-Muller, are examined. This report considers binary codes up to length 12, and the best self-complementary codes are compared to the best linear codes. Future research can consider binary codes of longer lengths and nonbinary codes. en_US
dc.language.iso en en_US
dc.rights Available to the World Wide Web en_US
dc.rights.uri http://creativecommons.org/licenses/by/2.5/ca/ *
dc.subject Binary Self-Complementary Codes en_US
dc.subject Self-Complementary Codes en_US
dc.title Binary Self-Complementary Codes en_US
dc.type project en_US
dc.contributor.supervisor Gulliver, Aaron. T.
dc.degree.department Department of Electrical and Computer Engineering en_US
dc.degree.level Master of Engineering M.Eng. en_US
dc.description.scholarlevel Graduate en_US

Files in this item

The following license files are associated with this item:

This item appears in the following Collection(s)

Show simple item record

Available to the World Wide Web Except where otherwise noted, this item's license is described as Available to the World Wide Web

Search UVicSpace


My Account