- Full text PDF available (17)
101 With no = 4, p = 10, n can be increased to 16 * 40 = 640 also indebted to the referees for their valuable comments bits, the number of redundant symbols r = 160, k = and suggestions. 640-160 = 480 and r 7. lo-lo.
the Rudin-Shapiro sequence [lo], which have been proposed for use in phasing multitone signals to minimize peak factors [ll]. A&ret-A class of binary sequences of length N = 2m is considered, and it is shown that their aperiodic autocorrelations can be calculated recursively in a simple way. Based on this, the merit factor of the sequences is calculated and… (More)
Improvement to an earlier decoding algorithm for codes from algebraic geometry is presented. For codes from an arbitrary regular plane curve we correct up to d*/2-m2/8 + m /4-9/8 errors, where d* is the designed distance of the code and m is the degree of the curve. The complexity of finding the error locator is O(n7/3), where n is the length of the code.… (More)
Abstruct-The Markov chain that has maximum entropy for given first and second moments is determined. The solution provides a discrete analog to the continuous Gauss-Markov process.