Title :
If binary codes existed that exceed Gilbert-Varshamov bound they could not reach the cutoff rate of BSC
Author :
Beth, Thomas ; Lazic, Dejan E.
Author_Institution :
Fakultat fur Inf., Karlsruhe Univ., Germany
Abstract :
Binary block codes exceeding the Gilbert-Varshamov bound on the minimum Hamming distance (if such codes exist) have their error exponents below the one of the binary symmetric channel (BSC) in the interval (Rcrit, Rc) and they cannot reach the cutoff rate R0 and thus the capacity Rc of the BSC if a maximum likelihood decoder (MLD) is used
Keywords :
binary sequences; block codes; channel capacity; coding errors; error statistics; maximum likelihood decoding; Gilbert-Varshamov bound; binary block codes; binary symmetric channel; channel capacity; channel code; cutoff rate; error exponents; maximum likelihood decoder; minimum Hamming distance; AWGN channels; Australia; Binary codes; Block codes; Decoding; Entropy; Euclidean distance; Hamming distance; Upper bound;
Conference_Titel :
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location :
Whistler, BC
Print_ISBN :
0-7803-2453-6
DOI :
10.1109/ISIT.1995.531336
