We show that a recently proposed algorithm ([9]) for decoding cyclic codes may be applied efficiently to all binary cyclic codes with t ≤ 2 and n < 63.

The problem of finding the value and optimal strategies of players in cyclic games is studied. A polynomial time algorithm for solving cyclic games is proposed.

Abstract: Many modulated communication signals exhibit a cyclostationarity property. Cyclic-MUSIC algorithm uses the property to improve the detection capability and estimation accuracy over conventional MUSIC algorithm in DOA estimation. Based on cyclic-MUSIC, SC-SSF algorithm extends application bound from narrow-band signals to wideband signals, where a kind of pseudodata matrix is construct...

Based on a study of basic properties of cyclic graphs of prime order, we give an algorithm for computing lower bounds of classical Ramsey numbers. Our algorithm reduces certain amount of computation of cyclic graphs of prime order, since only some of them normalized cyclic graphs require computation in our method. Using the algorithm, we construct ten cyclic graphs of prime order to obtain new ...

Cyclic edit distances are a good measure of contour shapes dissimilarity. A Branch and Bound algorithm that speeds up the computation of cyclic edit distances with arbitrary weights for the edit operations is presented. The algorithm is modified to work with an external bound that further accelerates the computation when applied to classification problems.

This paper presents a new cyclic direction-of-arrival (DOA) estimation algorithm. By exploiting a new minimum-redundancy linear-array (MRLA) configuration and cyclostationarity, the proposed algorithm constructs a matrix pencil from the pseudodata matrix of 2N-1 virtual sensors which are the results of temporal and spatial processing with designed M-sensor SumMRLA. Theoretical analysis and comp...

This paper describes Patent Number U.S. 8,046,316 B2, titled “Cyclic Combinatorial Method and System”, issued by the US Patents and Trademarks Office on October 25, 2011. The patent is based on a combinatorial algorithm to solve cyclic optimization problems. First, the algorithm identifies cyclically distinct solutions of such problems by enumerating cyclically distinct combinations of the basi...