Results 211 to 220 of about 1,311 (253)
Some of the next articles are maybe not open access.
1996
Introduction and philosophy Chinese remainder algorithm in modular computations in algorithmics in bridging computations in coding theory in cryptography tutorial in information theory tutorial in algebra list of mathematical symbols.
C Ding, D Pei, A Salomaa
openaire +1 more source
Introduction and philosophy Chinese remainder algorithm in modular computations in algorithmics in bridging computations in coding theory in cryptography tutorial in information theory tutorial in algebra list of mathematical symbols.
C Ding, D Pei, A Salomaa
openaire +1 more source
Robustness in Chinese Remainder Theorem for Multiple Numbers and Remainder Coding
IEEE Transactions on Signal Processing, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hanshen Xiao +3 more
openaire +1 more source
Generalization of the Chinese remainder theorem
Vestnik St. Petersburg University: Mathematics, 2007Let \(B\) denote an \(m \times (m+1)\) \textit{basis} matrix with integer entries, and let \(r\) denote a column vector with \(m\) integer components. This paper presents sufficient conditions for vector solutions \(x\) with integer components of the linear system \(Bx = r\) in the cases that \(B\) is \textit{marginal} as well as \textit{saturated.} In
Davydova, I. M., Fedoseeva, E. Ya.
openaire +1 more source
Sheaf representation and Chinese remainder theorems
Algebra Universalis, 1992\textit{D. M. Clark} and \textit{P. H. Krauss} [``Global subdirect products'', Mem. Am. Math. Soc. 210 (1979; Zbl 0421.08001)] define an algebra to be globally (Boolean) representable by a class of algebras \({\mathcal M}\) if it is isomorphic to the algebra of the global sections of a subdirect sheaf whose index space is compact and \(T_ 0\) and whose
openaire +2 more sources
Historical development of the Chinese remainder theorem
Archive for History of Exact Sciences, 1988The paper is a survey of the main works on the Chinese Remainder Theorem, which owes its name to the fact that the first general algorithm for solving simultaneous congruences was given by the Chinese mathematician Qin Jiushao in 1247. After stating that the problem is derived from calendrical calculations' needs, the author mentions texts from ...
openaire +1 more source
1979
The Chinese remainder theorem is so named because it was known to the ancient Chinese. In its original form, it is good for solving problems, as we’ll see in the exercises. But suitably reinterpreted, it is a powerful tool for helping us understand how numbers relate in different moduli.
openaire +1 more source
The Chinese remainder theorem is so named because it was known to the ancient Chinese. In its original form, it is good for solving problems, as we’ll see in the exercises. But suitably reinterpreted, it is a powerful tool for helping us understand how numbers relate in different moduli.
openaire +1 more source
New Chinese remainder theorems
Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284), 2002The residue-to-binary conversion is the crucial step for residue arithmetic. The traditional methods are the Chinese remainder theorem (CRT) and the mixed radix conversion. This paper presents new Chinese remainder theorems I, II, and Ill for the residue-to-binary conversion, with the following detailed results.
openaire +1 more source
An infinite version of the Chinese remainder theorem
Commentarii mathematici Universitatis Sancti Pauli = Rikkyo Daigaku sugaku zasshi, 1991We quote from the author's preface: ``An immediate consequence of the Chinese remainder theorem is that if one imposes a finite number of congruence conditions modulo different primes on an \(n\)-tuple of integers then these conditions are ``independent''.
openaire +2 more sources
On the Chinese Remainder Theorem
Mathematische Nachrichten, 1958H. L. Schmid, Kurt Mahler
openaire +2 more sources