Title :
Diffuse codes with minimal guard space
Author_Institution :
Chair for Communications, Tech. Univ. Munchen, Germany
fDate :
27 Jun-1 Jul 1994
Abstract :
A new class of self-orthogonal convolutional diffuse codes with a guard space less than the constraint length is presented. The principal idea of diffuse coding consists in the enlargement of the distance between adjacent exponents of the generator polynomials in order to prevent interference from burst errors in the syndrome sequence
Keywords :
convolutional codes; burst errors; constraint length; exponents; generator polynomials; lower bound; minimal guard space; self-orthogonal convolutional diffuse codes; syndrome sequence; Computer errors; Convolutional codes; Equations; Informatics; Interference constraints; Polynomials; Telecommunication computing;
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
DOI :
10.1109/ISIT.1994.394947
