Abstract
Let Fq be the finite field of order q. We then denote by Fq[D] the set of polynomials in D with coefficients in Fq, and by Fq[D] the set of sequences on Fq:
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Forney G. D., Convolutional codes I: Algebraic structure, IFFF Trans. on Inf. Theory, vol. IT-16, 720, 1970.
Marcus M. and Minc H., A survey of matrix theory and matrix inequalities, Allyn and Bacon, Boston 1964.
Piret Ph., Structure and construction of cyclic convolutional codes. To appear in IEEE Trans. on Inf. Theory, vol. IT-22, 1976.
Piret Ph., On a class of alternating cyclic convolutional codes, IEEE Trans. on Inf. Theory, vol. IT-21, 64, 1975.
Layland J. and Mc Eliece R., An upper bound on the free distance of a tree code, J. P. L. Cal. Tech. Pasadena Space Program Summary 37–62, vol. 3, 63–64, April 1970.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1975 Springer-Verlag Wien
About this chapter
Cite this chapter
Piret, P. (1975). Notes on Cyclic Convolutional Codes. In: Longo, G. (eds) Information Theory New Trends and Open Problems. International Centre for Mechanical Sciences, vol 219. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2730-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-7091-2730-8_10
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-81378-2
Online ISBN: 978-3-7091-2730-8
eBook Packages: Springer Book Archive