Merging words according to their overlap yields a superstring. This basic operation allows to infer long strings from a collection of short pieces, as in genome assembly. To capture a maximum of overlaps, the goal is to infer the shortest superstring of a set of input words. The Shortest Cyclic Cover of Strings (SCCS) problem asks, instead of a single linear superstring, for a set of cyclic str...

In this paper, we propose the use of cyclic interval graphs as an alternative representation for register allocation. The \thickness" of the cyclic interval graph captures the notion of overlap between live ranges of variables relative to each particular point of time in the program execution. We demonstrate that cyclic interval graphs provide a feasible and e ective representation that accurat...

One of the important code of modern coding theory, the protograph LDPC code technology has been gained more and more attention due to its low encoding complexity, fast decoding speed, low BER, and simple optimization analysis process etc. the quasi-cyclic expansion algorithm of the protograph LDPC codes, named as PQCE algorithms, can complete the extension of protograph and eventually get the p...

In this paper, a new subspace based blind channel estimation method is proposed for OFDM systems over a time-dispersive channel. The proposed algorithm exploits the presence of virtual carriers and eliminates the cyclic prefiz; thereby leading to higher channel utilization than most previously reported cyclic prefix based estimators. A sufficient condition on the channel identifiability is deve...

The cyclic autocorrelation of common digital modulation is researched, and the relationship between the cyclic autocorrelation and the delay, corresponding to the symbol rate, is deduced, then a searching algorithm for the symbol rate is proposed. Theoretical analyses and simulation results show that this method has less computation complexity and is also quite accurate. The estimation result i...

In this article, we study the skew cyclic codes over R_{k}=F_{p}+uF_{p}+\dots +u^{k-1}F_{p} of length n. We characterize the skew cyclic codes of length $n$ over R_{k} as free left R_{k}[x;\theta]-submodules of R_{k}[x;\theta]/\langle x^{n}-1\rangle and construct their generators and minimal generating sets. Also, an algorithm has been provided to encode and decode these skew cyclic codes.

By moving the alkoxy group on the spacer from position 5 to position 4 to add another protocol for the algorithm for intermolecular and intramolecular hydrogen bonding interactions, highly regioselectivity of noncovalent synthesis of the hydrazide-based cyclic hexamers was achieved: one out of thirteen possible isomeric cyclic hexamers selectively formed and thus precise control of the two hydr...

The well-known approach of Bose, Ray-Chaudhuri and Hocquenghem and its generalization by Hartmann and Tzeng are lower bounds on the minimum distance of simple-root cyclic codes. We generalize these two bounds to the case of repeated-root cyclic codes and present a syndrome-based burst error decoding algorithm with guaranteed decoding radius based on an associated folded cyclic code. Furthermore...

We present a Kedlaya-style point counting algorithm for cyclic covers y = f(x) over a finite field Fpn with p not dividing r, and r and deg f not necessarily coprime. This algorithm generalizes the Gaudry–Gürel algorithm for superelliptic curves to a more general class of curves, and has essentially the same complexity. Our practical improvements include a simplified algorithm exploiting the au...