|
An Introduction to Error-Correcting Codes |
|
|
1 | (1) |
|
|
|
1 | (2) |
|
|
3 | (3) |
|
Syndrome Decoding, Hamming Codes, and Capacity of the Channel |
|
|
6 | (2) |
|
Codes over Bytes and Finite Fields |
|
|
8 | (2) |
|
|
10 | (1) |
|
|
11 | (2) |
|
Decoding of RS Codes: The Key Equation |
|
|
13 | (3) |
|
Decoding RS Codes with Euclid's Algorithm |
|
|
16 | (2) |
|
Applications: Burst and Random Error Correction |
|
|
18 | |
|
Modulation Codes for Storage Systems |
|
|
1 | (1) |
|
|
|
|
1 | (1) |
|
Constrained Systems and Codes |
|
|
2 | (2) |
|
Constraints for ISI Channels |
|
|
4 | (2) |
|
|
|
|
|
Channels with Colored Noise and Intertrack Interference |
|
|
6 | (1) |
|
|
7 | (2) |
|
|
9 | |
|
Soft-Output Decoding of Modulation Codes |
|
|
|
|
|
Runlength Limited Sequences |
|
|
1 | (1) |
|
Kees A. Schouhamer Immink |
|
|
|
1 | (1) |
|
Asymptotic Information Rate |
|
|
2 | (2) |
|
|
|
|
|
|
4 | (2) |
|
|
|
|
|
Weakly Constrained Sequences |
|
|
|
Two-Dimensional RLL Constraints |
|
|
|
Codes for the Noiseless Channel |
|
|
6 | |
|
Maximum Transition Run Coding |
|
|
1 | (1) |
|
|
|
1 | (1) |
|
Error Event Characterization |
|
|
2 | (2) |
|
Maximum Transition Run Codes |
|
|
4 | (6) |
|
Detector Design for MTR Constraints |
|
|
10 | (1) |
|
|
11 | (1) |
|
|
12 | |
|
|
1 | (1) |
|
|
|
|
1 | (1) |
|
Recording System and Spectrum Shaping Codes |
|
|
2 | (1) |
|
|
2 | (7) |
|
|
|
Dc-free Constraint Sequences |
|
|
|
Capacity of Dc-free Constraint |
|
|
|
Spectral Characteristics of Dc-free Constraint |
|
|
|
Encoding and Decoding of Dc-free Constraints |
|
|
|
Codes with Higher Order Spectral Zeros |
|
|
9 | (6) |
|
|
|
Sequences with Higher Order Zeros at f = 0 |
|
|
|
|
|
K -RDSf Sequences on Partial Response Channels |
|
|
|
Composite Constrained and Combined Encoding |
|
|
15 | (3) |
|
|
18 | |
|
Introduction to Constrained Binary Codes with Error Correction Capability |
|
|
1 | (1) |
|
|
|
|
1 | (1) |
|
|
2 | (2) |
|
Example: A Trellis Code Construction |
|
|
4 | (3) |
|
An Overview of Some Other Code Constructions |
|
|
7 | (4) |
|
Channel Models and Error Types |
|
|
|
|
|
Block and Trellis Code Constructions |
|
|
|
Combined Codes Directly Derived from Linear Error Correcting Codes |
|
|
|
Constrained Codes Carefully Matched to Error Correcting Codes |
|
|
|
Constructions Employing Ideas from Contemporary Developments in Coding Techniques |
|
|
|
Restrictions on the (d, k) Sequence |
|
|
|
|
|
Constructions Using the Lee or Levenshtein Metrics |
|
|
|
Spectral Shaping Constraints and Error Correction |
|
|
|
Maximum Likelihood Decoding of Standard Constrained Codes |
|
|
|
Post Combined Coding System Architectures |
|
|
11 | (1) |
|
|
12 | |
|
Constrained Coding and Error-Control Coding |
|
|
1 | (1) |
|
|
|
1 | (1) |
|
|
2 | (6) |
|
|
|
|
|
|
|
|
|
|
|
Reverse Concatenation and Soft Iterative Decoding |
|
|
8 | |
|
Convolutional Codes for Partial-Response Channels |
|
|
1 | (1) |
|
Bartolomeu F. Uchoa-Filho |
|
|
|
|
|
|
1 | (1) |
|
Encoding System Description and Preliminaries |
|
|
2 | (2) |
|
Trellis Codes for Partial-Response Channels Based Upon the Hamming Metric |
|
|
4 | (3) |
|
Trellis-Matched Codes for Partial-Response Channels |
|
|
7 | (3) |
|
Run-Length Limited Trellis-Matched Codes |
|
|
10 | (3) |
|
Cosets of Convolutional Codes |
|
|
|
Avoiding Flawed Codewords |
|
|
13 | (2) |
|
The Distance Spectrum Criterion for Trellis Codes |
|
|
15 | (1) |
|
Good Trellis-Matched Codes for the Partial-Response Channels Based on the Distance Spectrum Criterion |
|
|
15 | |
|
Capacity-Approaching Codes for Partial Response Channels |
|
|
1 | (1) |
|
|
|
|
|
1 | (1) |
|
The Channel Model and Capacity Definitions |
|
|
2 | (4) |
|
|
|
|
|
|
|
The Markov Channel Capacity |
|
|
|
Computing the Markov Channel Capacity |
|
|
|
Trellis Codes, Superchannels and Their Information Rates |
|
|
6 | (3) |
|
Coding Theorems for Superchannels |
|
|
|
Matched Information Rate (MIR) Trellis Codes |
|
|
9 | (4) |
|
Choosing the Extended Channel Trellis and the Superchannel Code Rate |
|
|
|
Choosing the Number of States in the Superchannel Choosing the Branch Type Numbers in the Superchannel |
|
|
|
Choosing the Branch Connections |
|
|
|
|
13 | (3) |
|
|
|
Choosing the Branch Input-Bit Assignment |
|
|
|
Determining the Outer Subcode Rates |
|
|
|
|
|
|
16 | (3) |
|
|
|
A Channel without Spectral Nulls |
|
|
|
|
19 | |
|
Coding and Detection for Multitrack Systems |
|
|
1 | (1) |
|
|
|
|
1 | (1) |
|
The Current State of Research in Multitrack Codes |
|
|
2 | (1) |
|
|
2 | (1) |
|
Multitrack Constrained Codes |
|
|
3 | (2) |
|
ITI Reducing Codes for PR Channels |
|
|
|
Constrained Coding for Improved Synchronization |
|
|
|
Low-Complexity Encoder and Decoder Implementations |
|
|
|
Multitrack Soft Error-Event Correcting Scheme |
|
|
5 | |
|
|
1 | (1) |
|
|
|
|
Principles of Turbo Coding |
|
|
2 | (4) |
|
Parallel Concatenated Convolutional Codes |
|
|
|
Other Concatenation Schemes |
|
|
|
Other Iteratively Decodable Codes |
|
|
|
Iterative Decoding of Turbo Codes |
|
|
6 | (3) |
|
Maximum A-Posteriori (MAP) Decoder |
|
|
|
The Iterative Decoder Structure |
|
|
|
Iterative Decoding of Serially Concatenated Convolutional Codes |
|
|
|
Other Iterative Decoding Algorithms |
|
|
|
Performance of Turbo Codes over AWGN Channels |
|
|
9 | (2) |
|
|
11 | (1) |
|
Partial Response Channels |
|
|
|
Realistic Recording Channel Models |
|
|
|
Turbo Codes for Recording Channels |
|
|
12 | (3) |
|
Turbo Coding without Turbo Equalization |
|
|
|
Turbo Coding with Turbo Equalization |
|
|
|
Convolutional Coding with an Interleaver |
|
|
|
Performance of Turbo Codes over Recording Channels |
|
|
15 | (3) |
|
|
|
|
|
|
18 | |
|
|
1 | (1) |
|
Representations of LPDC Codes |
|
|
2 | (2) |
|
|
|
|
|
LDPC Code Design Approaches |
|
|
4 | (3) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Iterative Decoding Algorithms |
|
|
7 | (10) |
|
|
|
Probability-Domain SPA Decoder |
|
|
|
|
|
Reduced Complexity Decoders |
|
|
|
|
17 | |
|
Concatenated Single-Parity Check Codes for High-Density Digital Recording Systems |
|
|
1 | (1) |
|
|
|
|
|
|
1 | (2) |
|
|
3 | (2) |
|
|
|
|
|
Iterative Decoding and Equalization |
|
|
|
Analysis of Distance Spectrum |
|
|
5 | (4) |
|
Distance Properties of TPC/SPC Coded PR Systems |
|
|
|
Distance Properties of Turbo/SPC Coded PR Systems |
|
|
|
Thresholds Analysis using Density Evolution |
|
|
9 | (4) |
|
Introduction to Density Evolution and Gaussian Approximation |
|
|
|
|
|
Message Flow Within the Inner MAP Decoder |
|
|
|
Message Flow Within the Outer Code |
|
|
|
|
|
|
13 | (3) |
|
|
16 | |
|
Structured Low-Density Parity-Check Codes |
|
|
1 | (1) |
|
|
|
|
|
|
1 | (3) |
|
Combinatorial Designs and their Bipartite Graphs |
|
|
4 | (1) |
|
LDPC Codes on Difference Families |
|
|
5 | (2) |
|
Codes on Projective Planes |
|
|
7 | (3) |
|
Lattice Construction of LDPC Codes |
|
|
10 | (2) |
|
Codes on a Rectangular Subset of an Integer Lattice |
|
|
|
Application in the Partial Response (PR) Channels |
|
|
12 | (4) |
|
Channel Model and Signal Generation |
|
|
|
Bit Error Rate (BER) of the Structured LDPC Codes Simulation Results |
|
|
|
|
16 | |
|
Turbo Coding for Multitrack Recording Channels |
|
|
1 | (14) |
|
|
|
|
|
2 | (1) |
|
Multitrack Recording Channels |
|
|
3 | (2) |
|
Information Theoretical Limits: Achievable Information Rates |
|
|
5 | (1) |
|
Turbo Coding for Multitrack Recording Systems |
|
|
6 | (9) |
|
Turbo Codes and Iterative Decoding Algorithm |
|
|
|
Turbo Coding and Turbo Equalization for ISI Channels |
|
|
|
MAP Detector and Iterative Decoding for Multitrack Systems |
|
|
|
|
|
|
15 | |
Index |
|