Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,283,418 papers from all fields of science
Search
Sign In
Create Free Account
QR code
Known as:
QR
, HCC2D (High Capacity 2-dimensional) codes
, MicroQR
Expand
QR code (abbreviated from Quick Response Code) is the trademark for a type of matrix barcode (or two-dimensional barcode) first designed for the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Android
BCH code
Bar-coded boarding pass
Barcode
Expand
Broader (2)
Automatic identification and data capture
Hypermedia
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Two way privacy preserving system using combine approach: QR-code & VCS
S. Degadwala
,
Sanjay Gaur
Innovations in Power and Advanced Computing…
2017
Corpus ID: 21347882
Quick Response (QR) code is a two dimensional (2D) barcode widely used in many applications such as manufacturing, advertising…
Expand
Highly Cited
2009
Highly Cited
2009
Error Control Coding for Multilevel Cell Flash Memories Using Nonbinary Low-Density Parity-Check Codes
Yuu Maeda
,
H. Kaneko
24th IEEE International Symposium on Defect and…
2009
Corpus ID: 7535095
Conventional flash memories generally utilize simple error control codes, such as Hamming code and BCH code. In future high…
Expand
Highly Cited
2006
Highly Cited
2006
Nested codes with multiple interpretations
Lei Xiao
,
T. Fuja
,
J. Kliewer
,
D. Costello
Annual Conference on Information Sciences and…
2006
Corpus ID: 17603625
This paper proposes a new approach to channel code design for wireless network applications. The resulting nested codes can be…
Expand
Highly Cited
2004
Highly Cited
2004
Product accumulate codes: a class of codes with near-capacity performance and low decoding complexity
Jing Li
,
K. Narayanan
,
C. Georghiades
IEEE Transactions on Information Theory
2004
Corpus ID: 18739074
We propose a novel class of provably good codes which are a serial concatenation of a single-parity-check (SPC)-based product…
Expand
Highly Cited
2003
Highly Cited
2003
Remarks on space-time codes including a new lower bound and an improved code
Hsiao-feng Lu
,
Yuankai Wang
,
Pavan Kumar
,
K. Chugg
IEEE Transactions on Information Theory
2003
Corpus ID: 5980519
This article presents a new asymptotically exact lower bound on pairwise error probability of a space-time code as well as an…
Expand
Highly Cited
2002
Highly Cited
2002
On the performance of high-rate TPC/SPC codes and LDPC codes over partial response channels
Jing Li
,
K. Narayanan
,
E. Kurtas
,
C. Georghiades
IEEE Transactions on Communications
2002
Corpus ID: 18799843
This paper evaluates two-dimensional turbo product codes based on single-parity check codes (TPC/SPC) and low-density parity…
Expand
Highly Cited
2000
Highly Cited
2000
Low density parity check codes for magnetic recording channels
Hongxin Song
,
R. Todd
,
J. R. Cruz
2000
Corpus ID: 17144277
We propose a system for magnetic recording, using a low density parity check (LDPC) code as the error-correcting-code, in…
Expand
1999
1999
Superluminal asymptotic tunneling times through one-dimensional photonic bandgaps in quarter-wave-stack dielectric mirrors
V. Laude
,
P. Tournois
1999
Corpus ID: 55943978
It is shown that the time needed for light to pass through the optical barrier associated with an antiresonant quarter-wave-stack…
Expand
Highly Cited
1996
Highly Cited
1996
Channel access and interference issues in multi-code DS-CDMA wireless packet (ATM) networks
Zhao Liu
,
M. Karol
,
M. Zarki
,
K. Eng
Wirel. Networks
1996
Corpus ID: 29449824
Multi-Code Direct-Sequence Code-Division-Multiple-Access (MC-CDMA) has been proposed as a flexible multiple access scheme for…
Expand
Highly Cited
1992
Highly Cited
1992
Synergistic Fault-Tolerance for Memory Chips
C. Stapper
,
Hsing-San Lee
IEEE Trans. Computers
1992
Corpus ID: 5124408
The discovery of a principle of synergistic fault tolerance is described, and it is shown analytically why it occurs. The…
Expand
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