Interleaved Reed-Solomon codes in concatenated code designs
Interleaved Reed-Solomon codes allow the correction of errors beyond half the minimum code distance if the errors are not distributed independently in the received signal but occur in bursts. Therefore, these codes are mainly considered for applications in channels, that cause correlated error patte...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | 5 pp. |
| container_title | |
| container_volume | |
| creator | Schmidt, G. Sidorenko, V.R. Bossert, M. |
| description | Interleaved Reed-Solomon codes allow the correction of errors beyond half the minimum code distance if the errors are not distributed independently in the received signal but occur in bursts. Therefore, these codes are mainly considered for applications in channels, that cause correlated error patterns, i.e., error bursts. However, they can also be quite interesting for memoryless channels causing independent random errors, if they are applied in concatenated code designs. We present such concatenated codes with several outer Reed-Solomon codewords and demonstrate the gain, that can be obtained by interleaved Reed-Solomon decoding in comparison to independently decoding the several words of the underlying Reed-Solomon codes. |
| doi_str_mv | 10.1109/ITW.2005.1531885 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1531885</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1531885</ieee_id><sourcerecordid>1531885</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-c18d2f3b0c3956dd60cc0c7c05281c0fa1ab9a754e328253ef969cb0d1632cb93</originalsourceid><addsrcrecordid>eNotT8tqwzAQFIRCS-p7oBf_gN2VFNkSPZXQhyEQSAw5Bnm1LgqOXCxT6N9XbbPsY5gdZlnGVhxKzsE8Nu2xFACq5EpyrdWCZabWkFKadWq3LIvxDCmkUUlwx56aMNM0kP0il--JXHEYh_EyhhxHRzH3vyCgnSmkcn9snhb-I8R7dtPbIVJ2nUvWvr60m_diu3trNs_bwhuYC-TaiV52gOlm5VwFiIA1ghKaI_SW287YWq1JCi2UpN5UBjtwvJICOyOX7OHf1hPR6XPyFzt9n64fyh9ulUYK</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Interleaved Reed-Solomon codes in concatenated code designs</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Schmidt, G. ; Sidorenko, V.R. ; Bossert, M.</creator><creatorcontrib>Schmidt, G. ; Sidorenko, V.R. ; Bossert, M.</creatorcontrib><description>Interleaved Reed-Solomon codes allow the correction of errors beyond half the minimum code distance if the errors are not distributed independently in the received signal but occur in bursts. Therefore, these codes are mainly considered for applications in channels, that cause correlated error patterns, i.e., error bursts. However, they can also be quite interesting for memoryless channels causing independent random errors, if they are applied in concatenated code designs. We present such concatenated codes with several outer Reed-Solomon codewords and demonstrate the gain, that can be obtained by interleaved Reed-Solomon decoding in comparison to independently decoding the several words of the underlying Reed-Solomon codes.</description><identifier>ISBN: 9780780394803</identifier><identifier>ISBN: 0780394801</identifier><identifier>DOI: 10.1109/ITW.2005.1531885</identifier><language>eng</language><publisher>IEEE</publisher><subject>Chromium ; Concatenated codes ; Decoding ; Equations ; Error correction codes ; Information theory ; Iterative algorithms ; Linear systems ; Reed-Solomon codes ; Signal design</subject><ispartof>IEEE Information Theory Workshop, 2005, 2005, p.5 pp.</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1531885$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,4050,4051,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1531885$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Schmidt, G.</creatorcontrib><creatorcontrib>Sidorenko, V.R.</creatorcontrib><creatorcontrib>Bossert, M.</creatorcontrib><title>Interleaved Reed-Solomon codes in concatenated code designs</title><title>IEEE Information Theory Workshop, 2005</title><addtitle>ITW</addtitle><description>Interleaved Reed-Solomon codes allow the correction of errors beyond half the minimum code distance if the errors are not distributed independently in the received signal but occur in bursts. Therefore, these codes are mainly considered for applications in channels, that cause correlated error patterns, i.e., error bursts. However, they can also be quite interesting for memoryless channels causing independent random errors, if they are applied in concatenated code designs. We present such concatenated codes with several outer Reed-Solomon codewords and demonstrate the gain, that can be obtained by interleaved Reed-Solomon decoding in comparison to independently decoding the several words of the underlying Reed-Solomon codes.</description><subject>Chromium</subject><subject>Concatenated codes</subject><subject>Decoding</subject><subject>Equations</subject><subject>Error correction codes</subject><subject>Information theory</subject><subject>Iterative algorithms</subject><subject>Linear systems</subject><subject>Reed-Solomon codes</subject><subject>Signal design</subject><isbn>9780780394803</isbn><isbn>0780394801</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotT8tqwzAQFIRCS-p7oBf_gN2VFNkSPZXQhyEQSAw5Bnm1LgqOXCxT6N9XbbPsY5gdZlnGVhxKzsE8Nu2xFACq5EpyrdWCZabWkFKadWq3LIvxDCmkUUlwx56aMNM0kP0il--JXHEYh_EyhhxHRzH3vyCgnSmkcn9snhb-I8R7dtPbIVJ2nUvWvr60m_diu3trNs_bwhuYC-TaiV52gOlm5VwFiIA1ghKaI_SW287YWq1JCi2UpN5UBjtwvJICOyOX7OHf1hPR6XPyFzt9n64fyh9ulUYK</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Schmidt, G.</creator><creator>Sidorenko, V.R.</creator><creator>Bossert, M.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2005</creationdate><title>Interleaved Reed-Solomon codes in concatenated code designs</title><author>Schmidt, G. ; Sidorenko, V.R. ; Bossert, M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-c18d2f3b0c3956dd60cc0c7c05281c0fa1ab9a754e328253ef969cb0d1632cb93</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Chromium</topic><topic>Concatenated codes</topic><topic>Decoding</topic><topic>Equations</topic><topic>Error correction codes</topic><topic>Information theory</topic><topic>Iterative algorithms</topic><topic>Linear systems</topic><topic>Reed-Solomon codes</topic><topic>Signal design</topic><toplevel>online_resources</toplevel><creatorcontrib>Schmidt, G.</creatorcontrib><creatorcontrib>Sidorenko, V.R.</creatorcontrib><creatorcontrib>Bossert, M.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Schmidt, G.</au><au>Sidorenko, V.R.</au><au>Bossert, M.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Interleaved Reed-Solomon codes in concatenated code designs</atitle><btitle>IEEE Information Theory Workshop, 2005</btitle><stitle>ITW</stitle><date>2005</date><risdate>2005</risdate><spage>5 pp.</spage><pages>5 pp.-</pages><isbn>9780780394803</isbn><isbn>0780394801</isbn><abstract>Interleaved Reed-Solomon codes allow the correction of errors beyond half the minimum code distance if the errors are not distributed independently in the received signal but occur in bursts. Therefore, these codes are mainly considered for applications in channels, that cause correlated error patterns, i.e., error bursts. However, they can also be quite interesting for memoryless channels causing independent random errors, if they are applied in concatenated code designs. We present such concatenated codes with several outer Reed-Solomon codewords and demonstrate the gain, that can be obtained by interleaved Reed-Solomon decoding in comparison to independently decoding the several words of the underlying Reed-Solomon codes.</abstract><pub>IEEE</pub><doi>10.1109/ITW.2005.1531885</doi></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 9780780394803 |
| ispartof | IEEE Information Theory Workshop, 2005, 2005, p.5 pp. |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_1531885 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Chromium Concatenated codes Decoding Equations Error correction codes Information theory Iterative algorithms Linear systems Reed-Solomon codes Signal design |
| title | Interleaved Reed-Solomon codes in concatenated code designs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T04%3A38%3A45IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Interleaved%20Reed-Solomon%20codes%20in%20concatenated%20code%20designs&rft.btitle=IEEE%20Information%20Theory%20Workshop,%202005&rft.au=Schmidt,%20G.&rft.date=2005&rft.spage=5%20pp.&rft.pages=5%20pp.-&rft.isbn=9780780394803&rft.isbn_list=0780394801&rft_id=info:doi/10.1109/ITW.2005.1531885&rft_dat=%3Cieee_6IE%3E1531885%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1531885&rfr_iscdi=true |