Abstract
This paper reports the results of a computer analysis of the distance properties of some of the best known rate 1/2, 1/3, and 1/4 codes to constraint length 14. The data include the truncated weight distributions of the codewords belonging to the incorrect subset which specifies the performance of the Viterbi algorithm as well as the minimum asymptotic growth rate of the weights of unmerged codewords which has been conjectured to be related to the length of error events produced by Viterbi decoders.
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.
