论文信息 - Generalized Permutations in Convolutional Codes

Generalized Permutations in Convolutional Codes

The properties of convolutional codes and their automorphisms are thoroughly investigated. The structure of the automorphism group of a code is related to some easily obtained properties of a minimal encoder of the code. The class of convolutional operators is introduced and these operators are used to enumerate codes that are equivalent for use on a symmetric memoryless channel.

Philippe Piret

[1] P. Delsarte. AUTOMORPHISMS OF ABELIAN CODES , 1970 .

[2] K. X. M. Tzeng,et al. Convolutional Codes and 'Their Performance in Communication Systems , 1971 .

[3] C. Curtis,et al. Representation theory of finite groups and associated algebras , 1962 .

[4] Philippe Piret. On a class of alternating cyclic convolutional codes , 1975, IEEE Trans. Inf. Theory.

[5] P. Delsarte,et al. Automorphism Groups of Convolutional Codes , 1978 .

[6] Andrew J. Viterbi,et al. Convolutional Codes and Their Performance in Communication Systems , 1971 .

[7] G. David Forney,et al. Convolutional codes I: Algebraic structure , 1970, IEEE Trans. Inf. Theory.

[8] Philippe Piret,et al. Semiregular Convolutional Codes: Definition, Structure, and Examples , 1977, Inf. Control..