DocumentCode
2622981
Title
Diffuse codes with minimal guard space
Author
Svirid, Yuri V.
Author_Institution
Chair for Communications, Tech. Univ. Munchen, Germany
fYear
1994
fDate
27 Jun-1 Jul 1994
Firstpage
24
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;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location
Trondheim
Print_ISBN
0-7803-2015-8
Type
conf
DOI
10.1109/ISIT.1994.394947
Filename
394947
Link To Document