Minimum weight convolutional codewords of finite length (Corresp.)
- 1 March 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 22 (2) , 243-246
- https://doi.org/10.1109/tit.1976.1055519
Abstract
For convolutional codes, thc variation of the minimum distance between nonmerging codewords with the lengths of those codewords is considered for all finite lengths. This is carried out in terms of a new distance parameter for convolutional codes do, the minimum average weight per branch over all cycles. Upper and lower bounds on do for binary convolutional codes of rate1/nare presented. The tradeoff betweend_{o}and the free distanced_{free}is obtained for small memory length codes.Keywords
This publication has 5 references indexed in Scilit:
- Circuits and Trees in Oriented Linear GraphsPublished by Springer Nature ,2009
- Convolutional Codes and Their Performance in Communication SystemsIEEE Transactions on Communication Technology, 1971
- Minimum distance estimates of the performance of sequential decodersIEEE Transactions on Information Theory, 1969
- On an asymptotic optimization problem in finite, directed, weighted graphsInformation and Control, 1968
- Inverses of Linear Sequential CircuitsIEEE Transactions on Computers, 1968