SOME LONG, RATE ONE-HALF, BINARY CONVOLUTION CODES WITH AN OPTIMUM DISTANCE PROFILE AND THE SYSTEMATIC VERSUS NONSYSTEMATIC CODE QUESTION

摘要

This paper gives a tabulation of long systematic and long quick-look-in (QLl) nonsystematic rate R = 1/2 binary convölutional codes with an optimum distance profile (ODP). These codes appear attractive for use with sequential deciders. Simulations for two of the new codes are reported and confirm Massey's conjecture that systematic and non-systematic codes of the same rate yield nearly identical computational and error probability performance with sequential decoding when the number of digits transmitted in the "tail" of the encoded frame is the same for both codes.