DocumentCode :
2620698
Title :
On the symmetries and structure of trellis codes
Author :
Rossin, Eric J. ; Rowe, David J. ; Heegard, Chris
Author_Institution :
Sch. of Electr. Eng., Cornell Univ., Ithaca, NY, USA
fYear :
1994
fDate :
27 Jun-1 Jul 1994
Firstpage :
161
Abstract :
We describe techniques from symbolic dynamics to determine the symmetry system of a trellis code. The construction starts with the partition permutation group, G, and enumerates short sequences over G under which the code is invariant. These sequences are then used to generate a graph. The process terminates when either the image of the symmetry graph is the entire code C (in which case C is known to be geometrically uniform), or the length of the generators exceeds a bound derived from the memory of C. As an example of using these techniques we analyze the V.34 codes
Keywords :
graph theory; sequences; trellis codes; V.34 codes; geometrically uniform code; memory; partition permutation group; sequences; symbolic dynamics; symmetry graph; symmetry system; trellis codes; Code standards; Convolutional codes; Image analysis; Information theory; Lattices; Legged locomotion; Modems; Signal analysis; State-space methods;
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.394811
Filename :
394811
Link To Document :
بازگشت