Cyclic turbo coding scheme improves minimum Hamming distance

摘要

A cyclic turbo coding scheme uses a sequence of integers equal to the residue modulo p of the counter with predetermined positive integer and congruent to a power of 2 modulo N (the polynomial period) and not to 2 modulo p, being a multiple of the period so that the binomial coefficient g(x) is equal to divisor of one transmitted sequence a(x).