Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,993,277 papers from all fields of science
Search
Sign In
Create Free Account
Convolutional code
Known as:
Recursive Systematic Convolutional code
, RSC
, Trellis diagram
Expand
In telecommunication, a convolutional code is a type of error-correcting code that generates parity symbols via the sliding application of a boolean…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
44 relations
ATSC-M/H
Adder (electronics)
Algebraic normal form
Algorithm
Expand
Broader (1)
Error detection and correction
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Soft Matter RSC Publishing
Bum Jun Park
,
Bomsock Lee
,
Taekyung Yu
2014
Corpus ID: 32806447
Please note that technical editing may introduce minor changes to the text and/or graphics, which may alter content. The journal…
Expand
Highly Cited
2014
Highly Cited
2014
Hierarchical core–shell α-Fe2O3@C nanotubes as a high-rate and long-life anode for advanced lithium ion batteries
X. Gu
,
Liang Chen
,
Shuo Liu
,
Huayun Xu
,
Jian Yang
,
Y. Qian
2014
Corpus ID: 96366441
High-performance anode materials in lithium ion batteries greatly rely on the elaborate control of their size, shape, structure…
Expand
Highly Cited
2007
Highly Cited
2007
General-Purpose Computation Using Graphics Hardware for Fast HDR Image Processing
Dawid Paja̧k
2007
Corpus ID: 3070481
This paper presents a new approach to hardware aided image processing and analysis, primarily focused on HDR imaging. In order to…
Expand
Highly Cited
2001
Highly Cited
2001
Design of trellis codes for source coding with side information at the decoder
Xin Wang
,
M. Orchard
Proceedings DCC . Data Compression Conference
2001
Corpus ID: 32755745
The problem of source coding with side information at the decoder arises in many practical scenarios. Although this problem has…
Expand
Highly Cited
1997
Highly Cited
1997
I-Q TCM: reliable communication over the Rayleigh fading channel close to the cutoff rate
S. Al-Semari
,
T. Fuja
IEEE Transactions on Information Theory
1997
Corpus ID: 33294755
This paper presents some trellis codes that provide high coding gain to channels with slow, non frequency-selective Rayleigh…
Expand
Highly Cited
1997
Highly Cited
1997
An 8/9 Rate Time-varying Trellis Code For High Density Magnetic Recording
W. Bliss
IEEE International Magnetics Conference
1997
Corpus ID: 42095389
A simple time-varying trellis code constraint is introduced which achieves 2.2 dB coding gain with the EEPR4 partial response…
Expand
Highly Cited
1990
Highly Cited
1990
The performance of trellis-coded MDPSK with multiple symbol detection
D. Divsalar
,
M. Simon
,
M. Shahshahani
IEEE Transactions on Communications
1990
Corpus ID: 37500910
The idea of using a multiple (more than two) symbol observation interval to improve error probability performance is applied to…
Expand
Highly Cited
1989
Highly Cited
1989
Bandwidth efficient coding for fading channels: code construction and performance analysis
C. Schlegel
,
D. Costello
IEEE Journal on Selected Areas in Communications
1989
Corpus ID: 41563470
The authors apply a general method of bounding the event error probability of TCM (trellis-coded modulation) schemes to fading…
Expand
Highly Cited
1988
Highly Cited
1988
The design of trellis coded MPSK for fading channels: set partitioning for optimum code design
D. Divsalar
,
M. Simon
IEEE Transactions on Communications
1988
Corpus ID: 5198398
A previous work on criteria for designing trellis-coded MPSK modulation to achieve minimum error probability performance on the…
Expand
Highly Cited
1988
Highly Cited
1988
Multiple trellis coded modulation (MTCM)
D. Divsalar
,
M. Simon
IEEE Transactions on Communications
1988
Corpus ID: 15307531
The authors demonstrate a trellis coded modulation technique referred to as multiple trellis coded modulation (MTCM) wherein more…
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