Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,230,571 papers from all fields of science
Search
Sign In
Create Free Account
Modulo operation
Known as:
Mod operator
, Modulo function
, Mod
Expand
In computing, the modulo operation finds the remainder after division of one number by another (sometimes called modulus). Given two positive numbers…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
AC (complexity)
AMPL
Assertion (software development)
BASIC
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Fast Arithmetic Modulo 2xpy± 1
Joppe W. Bos
,
Simon J. Friedberger
IACR Cryptology ePrint Archive
2016
Corpus ID: 195346138
2006
2006
MAI-Free MC-CDMA Systems Based on Hadamard–Walsh Codes
S. Tsai
,
Yuan-Pei Lin
,
C.-C. Jay Kuo
IEEE Transactions on Signal Processing
2006
Corpus ID: 8675500
It is known that multicarrier code-division multiple-access (MC-CDMA) systems suffer from multiaccess interference (MAI) when the…
Expand
Highly Cited
1994
Highly Cited
1994
Trellis-coded continuous-phase frequency-shift keying with ring convolutional codes
R. H. Yang
,
Desmond P. Taylor
IEEE Transactions on Information Theory
1994
Corpus ID: 206393460
Trellis-coding techniques are applied to continuous-phase frequency-shift keying (CPFSK). A new coding scheme based on…
Expand
1994
1994
Design of high-speed residue-to-binary number system converter based on Chinese Remainder Theorem
S. Piestrak
Proceedings IEEE International Conference on…
1994
Corpus ID: 8360418
The carry-free nature of the residue number system (RNS) has made it attractive for implementing a variety of specialized high…
Expand
1994
1994
Optimal evolutionary tree comparison by sparse dynamic programming
M. Farach
,
M. Thorup
Proceedings 35th Annual Symposium on Foundations…
1994
Corpus ID: 12156126
In computational biology one is often interested in finding the concensus between different evolutionary trees for the same set…
Expand
1993
1993
Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations
Jordi Levy
,
J. Agustí-Cullell
International Conference on Rewriting Techniques…
1993
Corpus ID: 14710645
We propose an extension of rewriting techniques to derive inclusion relations \(a \subseteq b\) between terms built from…
Expand
Review
1978
Review
1978
Group characters: Sequences with good correlation properties
R. Scholtz
,
L. Welch
IEEE Transactions on Information Theory
1978
Corpus ID: 32585682
The structure of the group of integers relatively prime to n under multiplication modulo n is reviewed, and the basic properties…
Expand
1970
1970
Calculation of Fourier transforms on finite Abelian groups (Corresp.)
G. G. Apple
,
P. Wintz
IEEE Transactions on Information Theory
1970
Corpus ID: 11002825
A recent paper by Crimmins et al. deals with minimization of mean-square error for group codes by the use of Fourier transforms…
Expand
1964
1964
A simply connected 3-manifold is ³ if it is the sum of a solid torus and the complement of a torus knot
J. Hempel
1964
Corpus ID: 121860795
It has been shown [6] that any closed, connected, orientable 3manifold can be constructed by removing a finite number, k, of…
Expand
1956
1956
ALGEBRAIC EXTENSION OF NORMED ALGEBRAS
R. Arens
,
K. Hoffmann
1956
Corpus ID: 121447851
in B. The classical method of field extension (forming the polynomial ring A [x] and reducing modulo the principal ideal J of 1.1…
Expand