Coding of insertion-deletion-substitution channels without markers

In this paper, we deal with coding for synchronization errors. In conventional studies, to combat such errors, periodic synchronization markers are inserted or specifier and watermark codes are concatenated. These codes enable estimation of synchronous errors, but do not have ability to correct rand...

Full description

Saved in:
Bibliographic Details
Main Authors: Goto, Ryohei, Kasai, Kenta, Kaneko, Haruhiko
Format: Conference Proceeding
Language:English
Subjects:
Channels
Coding
Decoding
Encoding
Information theory
Markers
Markov processes
Mathematical analysis
Mathematical models
Parity check codes
Synchronism
Synchronization
Watermarking
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we deal with coding for synchronization errors. In conventional studies, to combat such errors, periodic synchronization markers are inserted or specifier and watermark codes are concatenated. These codes enable estimation of synchronous errors, but do not have ability to correct random errors. Low-density parity-check codes are usually concatenate to correct random errors. Due to the lack of dependence of information, periodic synchronization marker insertion prevents codes to approach the capacity. Recently, it is observed that spatially-coupled codes universally approach the symmetric information rate (SIR) of arbitrary finite state Markov channels. We introduce a synchronously erroneous finite state Markov channel model whose SIR is computable. Numerical experiments demonstrate spatially-coupled codes approach the SIR of the channel.
ISSN:2157-8117
DOI:10.1109/ISIT.2016.7541376