Marker codes for channels with insertions and deletions

Coding for channels with synchronization errors is studied. Marker codes, each consisting of a low-density parity-check code with inserted markers, are developed. At low insertion-deletion probabilities marker codes are shown to outperform watermark codes. Full iterative decoding enhances performance to close to the capacity bounds. The low-density parity-check codes are optimized and the best known rate R = 0.5 code for the insertion-deletion channel presented. The codes are also shown to be effective on the bit-deletion channel.

• Type: Journal
• Year: 2005
• Where: ADT
• Authors: Edward A. Ratzer
• Keywords: ADT 2005, ADT 2008, Low-density Parity-check Codes, Marker Codes, Probabilities Marker Codes