Sparse Graph Codes for Channels with Synchronous Errors
Summary :
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 [1] and the extended version for FSMC [2] to the channel Numerical experiments demonstrated spatially-coupled codes approach the SIR of the channel.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E101-A No.12 pp.2064-2071
- Publication Date
- 2018/12/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E101.A.2064
- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)
- Category
- Coding theory and techniques
Authors
Ryohei GOTO
Tokyo Institute of Technology
Kenta KASAI
Tokyo Institute of Technology
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Ryohei GOTO, Kenta KASAI, "Sparse Graph Codes for Channels with Synchronous Errors" in IEICE TRANSACTIONS on Fundamentals,
vol. E101-A, no. 12, pp. 2064-2071, December 2018, doi: 10.1587/transfun.E101.A.2064.
Abstract: 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 [1] and the extended version for FSMC [2] to the channel Numerical experiments demonstrated spatially-coupled codes approach the SIR of the channel.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.2064/_p
Copy
@ARTICLE{e101-a_12_2064,
author={Ryohei GOTO, Kenta KASAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Sparse Graph Codes for Channels with Synchronous Errors},
year={2018},
volume={E101-A},
number={12},
pages={2064-2071},
abstract={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 [1] and the extended version for FSMC [2] to the channel Numerical experiments demonstrated spatially-coupled codes approach the SIR of the channel.},
keywords={},
doi={10.1587/transfun.E101.A.2064},
ISSN={1745-1337},
month={December},}
Copy
TY - JOUR
TI - Sparse Graph Codes for Channels with Synchronous Errors
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2064
EP - 2071
AU - Ryohei GOTO
AU - Kenta KASAI
PY - 2018
DO - 10.1587/transfun.E101.A.2064
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E101-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2018
AB - 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 [1] and the extended version for FSMC [2] to the channel Numerical experiments demonstrated spatially-coupled codes approach the SIR of the channel.
ER -
English
