DocumentCode
2622491
Title
Cyclic q-ary images of codes and burst correction
Author
Wafo, W. ; Wolfmann, J.
Author_Institution
G.E.C.T., Toulon Univ., La Garde, France
fYear
1994
fDate
27 Jun-1 Jul 1994
Firstpage
49
Abstract
In the case where the cyclic code C is determined by a constancy-clique code described in Jensen´s (see IEEE Trans. Inform. Theory, vol.38, p.950-959, 1992) theorem, we are able to find a lower bound for the minimum weight of C. By using the previous proposition we deduce lower bounds for the burst correction capacity of cyclic codes with composite lengths
Keywords
cyclic codes; error correction codes; burst correction; code length; composite lengths; constancy-clique code; cyclic codes; cyclic q-ary images; lower bound; minimum weight; Concatenated codes; Galois fields; Reactive power;
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.394921
Filename
394921
Link To Document