DocumentCode :
2060625
Title :
On convolutional codes and sphere packing bounds
Author :
Rosnes, Eirik ; Ytrehus, Øyvind
Author_Institution :
Dept. of Informatics, Bergen Univ., Norway
fYear :
2004
fDate :
27 June-2 July 2004
Firstpage :
458
Abstract :
We introduce general sphere packing bounds for convolutional codes. These improve upon the Heller bound [J.L.Heller (1968)] for high rate convolutional codes. For example, based on the Heller bound, McEliece [2, p. 1114] suggested that for a rate (n-1)/n code of free distance 5 with ν memory elements in its minimum encoder, asymptotically as ν → ∞ it holds that n ≤ 2(ν+1)2/. a simple corollary of our bounds shows that in this case, n ≲2ν2/, an improvement by a factor of √2. The bound can be further strengthened.
Keywords :
convolutional codes; convolutional code; encoder; free distance code; memory element; sphere packing bound; Block codes; Convolutional codes; Informatics; Parity check codes; Polynomials; Upper bound; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN :
0-7803-8280-3
Type :
conf
DOI :
10.1109/ISIT.2004.1365496
Filename :
1365496
Link To Document :
بازگشت