An accelerated search algorithm for punctured convolutional codes

An accelerated search algorithm for punctured convolutional codes is presented. Its application yields a significant extension of recent results on punctured convolutional codes to higher rates (up to 13/14) and longer memory (up to 12). The algorithm enables the search of a new class of codes, defined over a much larger code space, which provides greatly improved error performance. The new codes have the prospect of wide applications in digital satellite, fiber-optical, personal mobile, and many other communications systems including mass information storage systems. A performance comparison between the new and existing classes of code is effected.