In estimating frequencies given that the signal waveforms are undersampled multiple times, Xia and his collaborators proposed to use a generalized version of Chinese remainder Theorem (CRT), where the moduli are dm1, dm2, · · · , dmk with m1,m2, · · · ,mk being pairwise coprime. If the errors of the corrupted remainders are within d 4 , their schemes are able to construct an approximation of th...

A new threshold scheme for the Digital Signature Standard is proposed using Asmuth-Bloom secret sharing based on the Chinese Remainder Theorem. The proposed scheme is simple and can be used practically in real life.

We prove that there is a compact separable continuum that (consistently) is not a remainder of the real line.

Feature subset selection has become more and more a common topic of research. This popularity is partly due to the growth in the number of features and application domains. It is of the greatest importance to take the most of every evaluation of the inducer, which is normally the more costly part. In this paper, a technique is proposed that takes into account the inducer evaluation both in the ...

We introduce concepts of “recursive polynomial remainder sequence (PRS)” and “recursive subresultant,” and investigate their properties. In calculating PRS, if there exists the GCD (greatest common divisor) of initial polynomials, we calculate “recursively” with new PRS for the GCD and its derivative, until a constant is derived. We call such a PRS a recursive PRS. We define recursive subresult...

We consider the distribution of spacings between consecutive elements in subsets of Z/qZ, where q is highly composite and the subsets are defined via the Chinese Remainder Theorem. We give a sufficient criterion for the spacing distribution to be Poissonian as the number of prime factors of q tends to infinity, and as an application we show that the value set of a generic polynomial modulo q ha...

A unique decoder for the Chinese remainder codes was stated in [1] in 2000. In this paper, we present a decoder which gives the same error correction radius by introducing syndromes of the Chinese remainder codes. The error positions can be found using a so–called error–locator integer Λ which appears in the proposed key equation. To find Λ, this key equation can be solved by the extended Eucli...

In this paper we will propose a high quality image steganography technique which can hide secret data within an image in such a way so that it is imperceptible to human eye. This method solves the overlapping problem of remainder and use modulo operator efficiently for hiding purpose. First, we calculate the base eight equivalent of target string. That increases the hiding capacity as well as r...

Player ONE chooses a meager set and player TWO, a nowhere dense set per inning. They play ω many innings. ONE's consecutive choices must form a (weakly) increasing sequence. TWO wins if the union of the chosen nowhere dense sets covers the union of the chosen meager sets. A strategy of TWO which depends on knowing only the uncovered part of the most recently chosen meager set is said to be a re...