Abstract
We study the maximum zero-run length, L/sub max/, of cosets of convolutional codes, and show that an associated block subcode to a large extent determines L/sub max/. A communication system or storage system may use a coset of a binary convolutional code for both symbol synchronization and error control. To achieve symbol synchronization, the coset must have a short maximum zero-run length, L/sub /(max). The shortest values of L/sub max/ can be found in the class of convolutional codes of rate (n-r)/n for which at least one row of a minimal parity check matrix is nonpolynomial. We focus on this class.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
