Sparse Graph Codes for Channels with Synchronous Errors

Sparse Graph Codes for Channels with Synchronous Errors

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-coupl...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Communications and Computer Sciences, 2018/12/01, Vol.E101.A(12), pp.2064-2071
Hauptverfasser: GOTO, Ryohei, KASAI, Kenta
Format: Artikel
Sprache:eng
Schlagworte:
synchronous errors
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 2071
container_issue 12
container_start_page 2064
container_title IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
container_volume E101.A
creator GOTO, Ryohei
KASAI, Kenta
description 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.
doi_str_mv 10.1587/transfun.E101.A.2064
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2304883986</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2304883986</sourcerecordid><originalsourceid>FETCH-LOGICAL-c414t-71fa4794bf85e98e2b568d57cc6148c38b4214c91c025461057d755874baca653</originalsourceid><addsrcrecordid>eNplkE1Lw0AQhhdRsFb_gYeA58SdZL9yLKG2QsFD9bxsthvTUnfjbIL035tSLYKnubzPOzMPIfdAM-BKPvZofGwGn82BQjbLcirYBZmAZDyFopCXZEJLEKniVF2Tmxh3lILKgU2IXHcGo0sWaLo2qcLGxaQJmFSt8d7tY_K17dtkffC2xeDDEJM5YsB4S64as4_u7mdOydvT_LVapquXxXM1W6WWAetTCY1hsmR1o7grlctrLtSGS2sFMGULVbPxDFuCpTlnAiiXG8nHn1htrBG8mJKHU2-H4XNwsde7MKAfV-q8oEypolRiTLFTymKIEV2jO9x-GDxooPqoSP8q0kdFeqaPikZsdcJ2sTfv7gwZ7Ld27_5BkP_FzzHbGtTOF98MM3YQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2304883986</pqid></control><display><type>article</type><title>Sparse Graph Codes for Channels with Synchronous Errors</title><source>J-STAGE Free</source><creator>GOTO, Ryohei ; KASAI, Kenta</creator><creatorcontrib>GOTO, Ryohei ; KASAI, Kenta</creatorcontrib><description>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.</description><identifier>ISSN: 0916-8508</identifier><identifier>EISSN: 1745-1337</identifier><identifier>DOI: 10.1587/transfun.E101.A.2064</identifier><language>eng</language><publisher>Tokyo: The Institute of Electronics, Information and Communication Engineers</publisher><subject>synchronous errors</subject><ispartof>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2018/12/01, Vol.E101.A(12), pp.2064-2071</ispartof><rights>2018 The Institute of Electronics, Information and Communication Engineers</rights><rights>Copyright Japan Science and Technology Agency 2018</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c414t-71fa4794bf85e98e2b568d57cc6148c38b4214c91c025461057d755874baca653</citedby><cites>FETCH-LOGICAL-c414t-71fa4794bf85e98e2b568d57cc6148c38b4214c91c025461057d755874baca653</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,1883,27924,27925</link.rule.ids></links><search><creatorcontrib>GOTO, Ryohei</creatorcontrib><creatorcontrib>KASAI, Kenta</creatorcontrib><title>Sparse Graph Codes for Channels with Synchronous Errors</title><title>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences</title><addtitle>IEICE Trans. Fundamentals</addtitle><description>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.</description><subject>synchronous errors</subject><issn>0916-8508</issn><issn>1745-1337</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><recordid>eNplkE1Lw0AQhhdRsFb_gYeA58SdZL9yLKG2QsFD9bxsthvTUnfjbIL035tSLYKnubzPOzMPIfdAM-BKPvZofGwGn82BQjbLcirYBZmAZDyFopCXZEJLEKniVF2Tmxh3lILKgU2IXHcGo0sWaLo2qcLGxaQJmFSt8d7tY_K17dtkffC2xeDDEJM5YsB4S64as4_u7mdOydvT_LVapquXxXM1W6WWAetTCY1hsmR1o7grlctrLtSGS2sFMGULVbPxDFuCpTlnAiiXG8nHn1htrBG8mJKHU2-H4XNwsde7MKAfV-q8oEypolRiTLFTymKIEV2jO9x-GDxooPqoSP8q0kdFeqaPikZsdcJ2sTfv7gwZ7Ld27_5BkP_FzzHbGtTOF98MM3YQ</recordid><startdate>20181201</startdate><enddate>20181201</enddate><creator>GOTO, Ryohei</creator><creator>KASAI, Kenta</creator><general>The Institute of Electronics, Information and Communication Engineers</general><general>Japan Science and Technology Agency</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20181201</creationdate><title>Sparse Graph Codes for Channels with Synchronous Errors</title><author>GOTO, Ryohei ; KASAI, Kenta</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c414t-71fa4794bf85e98e2b568d57cc6148c38b4214c91c025461057d755874baca653</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>synchronous errors</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>GOTO, Ryohei</creatorcontrib><creatorcontrib>KASAI, Kenta</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>GOTO, Ryohei</au><au>KASAI, Kenta</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Sparse Graph Codes for Channels with Synchronous Errors</atitle><jtitle>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences</jtitle><addtitle>IEICE Trans. Fundamentals</addtitle><date>2018-12-01</date><risdate>2018</risdate><volume>E101.A</volume><issue>12</issue><spage>2064</spage><epage>2071</epage><pages>2064-2071</pages><issn>0916-8508</issn><eissn>1745-1337</eissn><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.</abstract><cop>Tokyo</cop><pub>The Institute of Electronics, Information and Communication Engineers</pub><doi>10.1587/transfun.E101.A.2064</doi><tpages>8</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0916-8508
ispartof IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2018/12/01, Vol.E101.A(12), pp.2064-2071
issn 0916-8508
1745-1337
language eng
recordid cdi_proquest_journals_2304883986
source J-STAGE Free
subjects synchronous errors
title Sparse Graph Codes for Channels with Synchronous Errors
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T20%3A57%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Sparse%20Graph%20Codes%20for%20Channels%20with%20Synchronous%20Errors&rft.jtitle=IEICE%20Transactions%20on%20Fundamentals%20of%20Electronics,%20Communications%20and%20Computer%20Sciences&rft.au=GOTO,%20Ryohei&rft.date=2018-12-01&rft.volume=E101.A&rft.issue=12&rft.spage=2064&rft.epage=2071&rft.pages=2064-2071&rft.issn=0916-8508&rft.eissn=1745-1337&rft_id=info:doi/10.1587/transfun.E101.A.2064&rft_dat=%3Cproquest_cross%3E2304883986%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2304883986&rft_id=info:pmid/&rfr_iscdi=true