DocumentCode :
2607982
Title :
The complement of binary linear codes for error detection
Author :
Fu, Fang-Wei ; Klove, Torleiv
Author_Institution :
Temasek Labs., Nat. Univ. of Singapore, Singapore
fYear :
2002
fDate :
20-25 Oct. 2002
Firstpage :
187
Abstract :
For a binary code C of length n, let C~ = Vn/C, be the complementary code. The main result of this paper is to determine K(n), the largest integer such that C~ is good for error detection for all linear [n, k] codes C with k≤K(n).
Keywords :
binary codes; error detection codes; linear codes; binary linear codes; binary symmetric channel; complementary code; error detection; symbol error probability; undetected error probability; Binary codes; Computational Intelligence Society; Councils; Educational programs; Error probability; Feedback communications; Laboratories; Terminology;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Workshop, 2002. Proceedings of the 2002 IEEE
Print_ISBN :
0-7803-7629-3
Type :
conf
DOI :
10.1109/ITW.2002.1115449
Filename :
1115449
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2607982
بازگشت