Abstract
Assuming we only have the coded sequence produced by a convolutional encoder at one's disposal, is it possible to recover all the parameters defining this encoder ? The implementation of such complete reconstruction for convolutional codes of any rate is presented in this paper, for both noiseless and noisy communications. Each time, several different solutions, i.e. alleged reconstructed encoders, are obtained, contrary to the awaited unicity. Their study yields a new characterization of convolutional codes along with some properties.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. G. Hoffman and al. Coding Theory — The Essentials. Dekker, 1991
S. Lin and D. J. Costello Error Control Coding: Fundamentals and Applications Prentice Hall, 1983
R. E. Blahut Theory and Practice of Error Control Codes Addison Wesley, 1983
J. H. van Lint Coding Theory Springer Verlag, 1971
B. Rice Determining the parameters of a rate ⊅ convolutional code over GF(q). Third International Conference on Finite Fields and Applications. Glasgow, 1995.
W. Feller An Introduction to Probability Theory, Vol. 1 Wiley, 1966
E. Filiol Reconstruction de codeurs convolutifs sur GF(q). Mémoire de D.E.A., 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Filiol, E. (1997). Reconstruction of convolutional encoders over GF(q). In: Darnell, M. (eds) Crytography and Coding. Cryptography and Coding 1997. Lecture Notes in Computer Science, vol 1355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024454
Download citation
DOI: https://doi.org/10.1007/BFb0024454
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63927-5
Online ISBN: 978-3-540-69668-1
eBook Packages: Springer Book Archive