DocumentCode
2253790
Title
On the probability of undetected error and the computational complexity to detect an error for iterated codes
Author
Nishijima, Toshihisa ; Hirasawa, Shigeichi
Author_Institution
Dept. of Ind. & Syst. Eng., Hosei Univ., Koganei, Japan
fYear
1995
fDate
17-22 Sep 1995
Firstpage
50
Abstract
We discuss the practical and asymptotic capabilities of iterated codes used as error detecting codes. We assume that the codes are binary linear block codes, and the channel is a binary symmetric channel with cross-over probability ε
Keywords
binary sequences; block codes; computational complexity; error detection codes; linear codes; probability; telecommunication channels; asymptotic capabilities; binary linear block codes; binary symmetric channel; computational complexity; crossover probability; error detecting codes; iterated codes; practical capabilities; undetected error probability; Block codes; Computational Intelligence Society; Computational complexity; Decoding; Educational institutions; Engineering management; Error correction; Hamming weight; Shift registers; Sufficient conditions;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location
Whistler, BC
Print_ISBN
0-7803-2453-6
Type
conf
DOI
10.1109/ISIT.1995.531152
Filename
531152
Link To Document