Binary Self-Complementary Codes

dc.contributor.authorAsemota, Ifeyinwa
dc.contributor.supervisorGulliver, Aaron. T.
dc.date.accessioned2016-09-30T22:33:07Z
dc.date.available2016-09-30T22:33:07Z
dc.date.copyright2016en_US
dc.date.issued2016-09-30
dc.degree.departmentDepartment of Electrical and Computer Engineeringen_US
dc.degree.levelMaster of Engineering M.Eng.en_US
dc.description.abstractA 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.description.scholarlevelGraduateen_US
dc.identifier.urihttp://hdl.handle.net/1828/7583
dc.language.isoenen_US
dc.rightsAvailable to the World Wide Weben_US
dc.rights.urihttp://creativecommons.org/licenses/by/2.5/ca/*
dc.subjectBinary Self-Complementary Codesen_US
dc.subjectSelf-Complementary Codesen_US
dc.titleBinary Self-Complementary Codesen_US
dc.typeprojecten_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Asemota_Ifeyinwa_M.Eng_2016.pdf
Size:
144.23 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.74 KB
Format:
Item-specific license agreed upon to submission
Description: