Enhanced Recursive Reed-Muller Erasure Decoding
Recent work have shown that Reed-Muller (RM) codes achieve the erasure channel capacity. However, this performance is obtained with maximum-likelihood decoding which can be costly for practical applications. In this paper, we propose an encoding/decoding scheme for Reed-Muller codes on the packet er...
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Artikel |
| 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 | |
| container_title | |
| container_volume | |
| creator | Soro, Alexandre Lacan, Jerome Roca, Vincent Savin, Valentin Cunche, Mathieu |
| description | Recent work have shown that Reed-Muller (RM) codes achieve the erasure
channel capacity. However, this performance is obtained with maximum-likelihood
decoding which can be costly for practical applications. In this paper, we
propose an encoding/decoding scheme for Reed-Muller codes on the packet erasure
channel based on Plotkin construction. We present several improvements over the
generic decoding. They allow, for a light cost, to compete with
maximum-likelihood decoding performance, especially on high-rate codes, while
significantly outperforming it in terms of speed. |
| doi_str_mv | 10.48550/arxiv.1601.06908 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1601_06908</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1601_06908</sourcerecordid><originalsourceid>FETCH-arxiv_primary_1601_069083</originalsourceid><addsrcrecordid>eNpjYJA0NNAzsTA1NdBPLKrILNMzNDMw1DMwszSw4GTQd83LSMxLTk1RCEpNLi0qzixLBbJSU3R9S3NyUosUXIsSi0uLUhVcUpPzUzLz0nkYWNMSc4pTeaE0N4O8m2uIs4cu2Oj4gqLM3MSiyniQFfFgK4wJqwAA8oEwIA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Enhanced Recursive Reed-Muller Erasure Decoding</title><source>arXiv.org</source><creator>Soro, Alexandre ; Lacan, Jerome ; Roca, Vincent ; Savin, Valentin ; Cunche, Mathieu</creator><creatorcontrib>Soro, Alexandre ; Lacan, Jerome ; Roca, Vincent ; Savin, Valentin ; Cunche, Mathieu</creatorcontrib><description>Recent work have shown that Reed-Muller (RM) codes achieve the erasure
channel capacity. However, this performance is obtained with maximum-likelihood
decoding which can be costly for practical applications. In this paper, we
propose an encoding/decoding scheme for Reed-Muller codes on the packet erasure
channel based on Plotkin construction. We present several improvements over the
generic decoding. They allow, for a light cost, to compete with
maximum-likelihood decoding performance, especially on high-rate codes, while
significantly outperforming it in terms of speed.</description><identifier>DOI: 10.48550/arxiv.1601.06908</identifier><language>eng</language><subject>Computer Science - Information Theory ; Mathematics - Information Theory</subject><creationdate>2016-01</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,777,882</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1601.06908$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1601.06908$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Soro, Alexandre</creatorcontrib><creatorcontrib>Lacan, Jerome</creatorcontrib><creatorcontrib>Roca, Vincent</creatorcontrib><creatorcontrib>Savin, Valentin</creatorcontrib><creatorcontrib>Cunche, Mathieu</creatorcontrib><title>Enhanced Recursive Reed-Muller Erasure Decoding</title><description>Recent work have shown that Reed-Muller (RM) codes achieve the erasure
channel capacity. However, this performance is obtained with maximum-likelihood
decoding which can be costly for practical applications. In this paper, we
propose an encoding/decoding scheme for Reed-Muller codes on the packet erasure
channel based on Plotkin construction. We present several improvements over the
generic decoding. They allow, for a light cost, to compete with
maximum-likelihood decoding performance, especially on high-rate codes, while
significantly outperforming it in terms of speed.</description><subject>Computer Science - Information Theory</subject><subject>Mathematics - Information Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNpjYJA0NNAzsTA1NdBPLKrILNMzNDMw1DMwszSw4GTQd83LSMxLTk1RCEpNLi0qzixLBbJSU3R9S3NyUosUXIsSi0uLUhVcUpPzUzLz0nkYWNMSc4pTeaE0N4O8m2uIs4cu2Oj4gqLM3MSiyniQFfFgK4wJqwAA8oEwIA</recordid><startdate>20160126</startdate><enddate>20160126</enddate><creator>Soro, Alexandre</creator><creator>Lacan, Jerome</creator><creator>Roca, Vincent</creator><creator>Savin, Valentin</creator><creator>Cunche, Mathieu</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20160126</creationdate><title>Enhanced Recursive Reed-Muller Erasure Decoding</title><author>Soro, Alexandre ; Lacan, Jerome ; Roca, Vincent ; Savin, Valentin ; Cunche, Mathieu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-arxiv_primary_1601_069083</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Computer Science - Information Theory</topic><topic>Mathematics - Information Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Soro, Alexandre</creatorcontrib><creatorcontrib>Lacan, Jerome</creatorcontrib><creatorcontrib>Roca, Vincent</creatorcontrib><creatorcontrib>Savin, Valentin</creatorcontrib><creatorcontrib>Cunche, Mathieu</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Soro, Alexandre</au><au>Lacan, Jerome</au><au>Roca, Vincent</au><au>Savin, Valentin</au><au>Cunche, Mathieu</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Enhanced Recursive Reed-Muller Erasure Decoding</atitle><date>2016-01-26</date><risdate>2016</risdate><abstract>Recent work have shown that Reed-Muller (RM) codes achieve the erasure
channel capacity. However, this performance is obtained with maximum-likelihood
decoding which can be costly for practical applications. In this paper, we
propose an encoding/decoding scheme for Reed-Muller codes on the packet erasure
channel based on Plotkin construction. We present several improvements over the
generic decoding. They allow, for a light cost, to compete with
maximum-likelihood decoding performance, especially on high-rate codes, while
significantly outperforming it in terms of speed.</abstract><doi>10.48550/arxiv.1601.06908</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.1601.06908 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_1601_06908 |
| source | arXiv.org |
| subjects | Computer Science - Information Theory Mathematics - Information Theory |
| title | Enhanced Recursive Reed-Muller Erasure Decoding |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-19T08%3A12%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Enhanced%20Recursive%20Reed-Muller%20Erasure%20Decoding&rft.au=Soro,%20Alexandre&rft.date=2016-01-26&rft_id=info:doi/10.48550/arxiv.1601.06908&rft_dat=%3Carxiv_GOX%3E1601_06908%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |