Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kofi D. Anim-Appiah

dblp:375/4535 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2001
0000-0002-4894-1817ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory
channel coding
0.012001
Turbo codes cascaded with high-rate block codes for (O, κ)-constrained channels · IEEE J. Sel. Areas Commun. 2001
Coding theory
constrained coding
0.012001
Turbo codes cascaded with high-rate block codes for (O, κ)-constrained channels · IEEE J. Sel. Areas Commun. 2001
Coding theory › error-correcting codes › decoding
iterative decoding
0.012001
Turbo codes cascaded with high-rate block codes for (O, κ)-constrained channels · IEEE J. Sel. Areas Commun. 2001
Coding theory › error-correcting codes › decoding › iterative decoding
soft-input soft-output decoding
0.012001
Turbo codes cascaded with high-rate block codes for (O, κ)-constrained channels · IEEE J. Sel. Areas Commun. 2001
Coding theory › channel coding
turbo codes
0.012001
Turbo codes cascaded with high-rate block codes for (O, κ)-constrained channels · IEEE J. Sel. Areas Commun. 2001
Storage systems › magnetic recording
magnetic recording channel
0.012001
Turbo codes cascaded with high-rate block codes for (O, κ)-constrained channels · IEEE J. Sel. Areas Commun. 2001

Methods — techniques the papers use, named apart from their topics

union bound analysis · 0.1density evolution · 0.1
YearPublicationVenuePosition
2001 Turbo codes cascaded with high-rate block codes for (O, κ)-constrained channels
abstract
We consider several issues in the analysis and design of turbo coded systems for (O, /spl kappa/) input-constrained channels. These constraints commonly arise in magnetic recording channels. This system is characterized by a high-rate turbo code driving a high-rate (n-1)/n, small-length (O, /spl kappa/) block code. We discuss the properties of the (O, /spl kappa/) code that affect its performance on both an additive white Gaussian noise (AWGN) and a precoded dicode channel. We address soft-in soft-out (SISO) decoding of linear and nonlinear (O, /spl kappa/) codes and show that good (O, /spl kappa/) codes exist even when d/sub min/=1. For the (O, /spl kappa/) constrained AWGN channel, we present several rate (n-1)/n block codes that optimally tradeoff bit-error-rate performance with /spl kappa/. For the precoded dicode channel, we show that the systematic (O, n-1) modulation codes are superior to most other rate (n-1)/n block codes in terms of error-rate performance, and their attractiveness is increased by the fact that they do not contribute any significant complexity to the overall system.
Kofi D. Anim-Appiah, Steven W. McLaughlin
IEEE J. Sel. Areas Commun.1