For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Sparse Graph Codes for Channels with Synchronous Errors
Ryohei GOTO Kenta KASAI
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2018/12/01
Online ISSN: 1745-1337
Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Coding theory and techniques
synchronous errors, synchronous errors,
Full Text: PDF(891.8KB)
>>Buy this Article
In this paper, we deal with coding for synchronous errors. We introduce a synchronously erroneous finite state Markov channel model whose SIR is computable. We apply density evolution analysis  and the extended version for FSMC  to the channel Numerical experiments demonstrated spatially-coupled codes approach the SIR of the channel.