DocumentCode
3298021
Title
Proper self-complementary codes
Author
Kløve, Torleiv ; Yari, Somaye
Author_Institution
Dept. of Inf., Univ. of Bergen, Bergen, Norway
fYear
2010
fDate
17-20 Oct. 2010
Firstpage
118
Lastpage
122
Abstract
It is an open question if there exists proper binary linear codes for error detection for all lengths and dimensions. It is known that such codes exist for any given dimension when the length is above some explicit bound. The main result in this paper is new explicit bound that is much lower than the previously known bound. The construction is based on self-complementary codes. As an illustration, proper self-complementary codes are constructed for dimensions 5 and 6 and all lengths.
Keywords
binary codes; error detection; linear codes; binary linear codes; error detection; self-complementary codes; Books; Computer aided software engineering; Distribution functions; Generators; Informatics; Linear code; Vectors; error detection; proper codes; self-complementary codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory and its Applications (ISITA), 2010 International Symposium on
Conference_Location
Taichung
Print_ISBN
978-1-4244-6016-8
Electronic_ISBN
978-1-4244-6017-5
Type
conf
DOI
10.1109/ISITA.2010.5649432
Filename
5649432
Link To Document