Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,027,178 papers from all fields of science
Search
Sign In
Create Free Account
Quadratic residue
Known as:
Quadratic non-residue
, Quadratic nonresidue
, Quadratic residuosity
Expand
In number theory, an integer q is called a quadratic residue modulo n if it is congruent to a perfect square modulo n; i.e., if there exists an…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
31 relations
Blum Blum Shub
Bring radical
Computational hardness assumption
Conference graph
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Schussspurensicherung
P. Schyma
,
B. Madea
Rechtsmedizin
2010
Corpus ID: 196477799
ZusammenfassungSchmauchspuren sind im Wesentlichen unsichtbar. Ihre Sicherung im Verlauf der Fundortuntersuchung, der…
Expand
2008
2008
Uptake of carbon and nitrogen derived from carbon-13 and nitrogen-15 dual-labeled maize residue compost applied to radish, komatsuna, and chingensai for three consecutive croppings
A. Ebid
,
Hideto Ueno
,
A. Ghoneim
,
N. Asagi
Plant and Soil
2008
Corpus ID: 24417623
A pot experiment was conducted to determine the effects of the application of 13C (1.256 atom%) and 15N (1.098 atom%) dual…
Expand
Highly Cited
2007
Highly Cited
2007
Algebraic Decoding of Quadratic Residue Codes Using Berlekamp-Massey Algorithm
Yan-Haw Chen
,
T. Truong
,
Yaotsu Chang
,
Chong-Dao Lee
,
Shi-Huang Chen
Journal of information science and engineering
2007
Corpus ID: 12687847
In this paper, an algebraic decoding method is proposed for the quadratic residue codes that utilize the Berlekamp-Massey…
Expand
2007
2007
Spectral Efficiency Study of QC-CHPCs in Multirate Optical CDMA System
Cheng-Yuan Chang
,
Hung-Ta Chen
,
Guu-chang Yang
,
W. Kwong
IEEE Journal on Selected Areas in Communications
2007
Corpus ID: 33149909
Quadratic-congruence carrier-hopping prime codes (QC-CHPCs) with zero autocorrelation sidelobes, cross-correlation values of at…
Expand
2006
2006
Demonstration of an eight-user 115-Gchip/s incoherent OCDMA system using supercontinuum generation and optical time gating
C. Brès
,
I. Glesk
,
P. Prucnal
IEEE Photonics Technology Letters
2006
Corpus ID: 35850165
A system demonstration of an eight-user optical code-division multiple-access (OCDMA) star network, operating at 115 Gchip/s…
Expand
Highly Cited
2002
Highly Cited
2002
Proposal of a novel code for spectral amplitude-coding optical CDMA systems
Zou Wei
,
H. Ghafouri-Shiraz
IEEE Photonics Technology Letters
2002
Corpus ID: 32656079
We have proposed a new modified quadratic congruence (MQC) code for spectral amplitude-coding optical code division multiple…
Expand
2001
2001
Private Information Retrieval Based on the Subgroup Membership Problem
A. Yamamura
,
Taiichi Saito
Australasian Conference on Information Security…
2001
Corpus ID: 2300909
Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the…
Expand
Highly Cited
1988
Highly Cited
1988
High-speed signal processing using systolic arrays over finite rings
M. Taheri
,
G. Jullien
,
W. Miller
IEEE J. Sel. Areas Commun.
1988
Corpus ID: 1632671
A modular architecture for very fast digital signal processing (DSP) elements are presented. The computation is performed over…
Expand
Highly Cited
1981
Highly Cited
1981
Time-Frequency HOP Signals Part II: Coding Based upon Quadratic Congruences
E. Titlebaum
,
L. Sibul
IEEE Transactions on Aerospace and Electronic…
1981
Corpus ID: 35126715
High-efficiency multicomponent signals for maximization of signalto-noise ratio are investigated. Maximization of signal-to-noise…
Expand
1974
1974
Implication of a tryptophyl residue in the active site of dihydrofolate reductase.
Liu Jk
,
Dunlap Rb
1974
Corpus ID: 203845353
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE