Referenced Items are not available for this document.
Rate-k/n locally invertible convolutional encoders are defined. It is shown that a basic locally invertible encoder is minimal-basic. Local invertibility is used to re-derive Forney's (1973) upper and lower bounds on the maximum number of consecutive all zero branches in a convolutional codeword. A time-domain test for minimality of an encoder is given
Published in:
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Date of Conference: 17-22 Sep 1995
- Meeting Date :
- 17 Sep 1995-22 Sep 1995
- Print ISBN:
- 0-7803-2453-6
- INSPEC Accession Number:
- 5273813
- Conference Location :
- Whistler, BC
- Digital Object Identifier :
- 10.1109/ISIT.1995.531513
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
