Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,276,255 papers from all fields of science
Search
Sign In
Create Free Account
Concatenation
Known as:
Concat
, Concatenation (disambiguation)
, Concatenated
Expand
In formal language theory and computer programming, string concatenation is the operation of joining character strings end-to-end. For example, the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
Abstract family of languages
Bar recursion
Binary number
C string handling
Expand
Broader (1)
String (computer science)
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Rainbow: Combining Improvements in Deep Reinforcement Learning
Matteo Hessel
,
Joseph Modayil
,
+7 authors
David Silver
AAAI Conference on Artificial Intelligence
2017
Corpus ID: 19135734
The deep reinforcement learning community has made several independent improvements to the DQN algorithm. However, it is…
Expand
Highly Cited
2015
Highly Cited
2015
A NEXT GENERATION SMART CONTRACT & DECENTRALIZED APPLICATION PLATFORM
Vitalik Buterin
2015
Corpus ID: 19568665
When Satoshi Nakamoto first set the Bitcoin blockchain into motion in January 2009, he was simultaneously introducing two radical…
Expand
Highly Cited
2001
Highly Cited
2001
The capacity of low-density parity-check codes under message-passing decoding
T. Richardson
,
R. Urbanke
IEEE Transactions on Information Theory
2001
Corpus ID: 514746
We present a general method for determining the capacity of low-density parity-check (LDPC) codes under message-passing decoding…
Expand
Highly Cited
2001
Highly Cited
2001
Convergence behavior of iteratively decoded parallel concatenated codes
S. Brink
IEEE Transactions on Communications
2001
Corpus ID: 17070911
Mutual information transfer characteristics of soft in/soft out decoders are proposed as a tool to better understand the…
Expand
Highly Cited
2000
Highly Cited
2000
Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization
P. Parrilo
2000
Corpus ID: 122626142
In the first part of this thesis, we introduce a specific class of Linear Matrix Inequalities (LMI) whose optimal solution can be…
Expand
Highly Cited
1998
Highly Cited
1998
Reflections on the Prize Paper : "Near optimum error-correcting coding and decoding: turbo codes"
C. Berrou
,
A. Glavieux
1998
Corpus ID: 12044273
Highly Cited
1996
Highly Cited
1996
Near Shannon Limit Performance of Low Density Parity Check Codes
David J C Mackay
,
Radford M. Neal
1996
Corpus ID: 1478845
We report the empirical performance of Gallager’s low density parity check codes on Gaussian channels. We show that performance…
Expand
Review
1995
Review
1995
Nonlinear black-box modeling in system identification: a unified overview
J. Sjöberg
,
Qinghua Zhang
,
+5 authors
A. Juditsky
at - Automatisierungstechnik
1995
Corpus ID: 14444668
Review
1990
Review
1990
The self-organizing map
T. Kohonen
Neurocomputing
1990
Corpus ID: 9348814
Highly Cited
1946
Highly Cited
1946
Concatenation as a basis for arithmetic
W. Quine
Journal of Symbolic Logic (JSL)
1946
Corpus ID: 9491626
General syntax, the formal part of the general theory of signs, has as its basic operation the operation of concatenation…
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