A Correction to "Some Gabidulin Codes Cannot be List Decoded Efficiently at any Radius"
There is an error in the above titled paper [1] . As a result, the main statement of the paper is true for a subset of the Gabidulin codes for which it was initially stated. To be precise, our results on the list decodability still hold for the same parameters of n and m , but the evaluation poin...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory 2017-04, Vol.63 (4), p.2623-2624 |
|---|---|
| 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 | 2624 |
|---|---|
| container_issue | 4 |
| container_start_page | 2623 |
| container_title | IEEE transactions on information theory |
| container_volume | 63 |
| creator | Raviv, Netanel Wachter-Zeh, Antonia |
| description | There is an error in the above titled paper [1] . As a result, the main statement of the paper is true for a subset of the Gabidulin codes for which it was initially stated. To be precise, our results on the list decodability still hold for the same parameters of n and m , but the evaluation points have to be of a certain structure. |
| doi_str_mv | 10.1109/TIT.2017.2659766 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_7879463</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7879463</ieee_id><sourcerecordid>2174327156</sourcerecordid><originalsourceid>FETCH-LOGICAL-c896-22fa0b0692f5f5db88081f80f5e1ae522bd34d9938fba70fdcf97b1e4da50703</originalsourceid><addsrcrecordid>eNo9kE1LAzEQhoMoWKt3wUuo512TbD6PZa21UBBswWPIbhJIaTc12T3037ulxdMwM887Aw8AzxiVGCP1tl1tS4KwKAlnSnB-AyaYMVEozugtmCCEZaEolffgIefd2FKGyQT8zGEdU3JtH2IH-whnm3hwcGmaYId96MatdRnWputiDxsH1yH38N2149jChfehDa7r9ydoemi6E_w2Ngx59gjuvNln93StU7D5WGzrz2L9tVzV83XRSsULQrxBDeKKeOaZbaREEnuJPHPYOEZIYytqlaqkb4xA3rZeiQY7ag1DAlVT8Hq5ekzxd3C517s4pG58qAkWtCICMz5S6EK1KeacnNfHFA4mnTRG-ixPj_L0WZ6-yhsjL5dIcM7940IKRXlV_QFJkWmR</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2174327156</pqid></control><display><type>article</type><title>A Correction to "Some Gabidulin Codes Cannot be List Decoded Efficiently at any Radius"</title><source>IEEE Electronic Library (IEL)</source><creator>Raviv, Netanel ; Wachter-Zeh, Antonia</creator><creatorcontrib>Raviv, Netanel ; Wachter-Zeh, Antonia</creatorcontrib><description><![CDATA[There is an error in the above titled paper <xref ref-type="bibr" rid="ref1">[1] . As a result, the main statement of the paper is true for a subset of the Gabidulin codes for which it was initially stated. To be precise, our results on the list decodability still hold for the same parameters of <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">m </tex-math></inline-formula>, but the evaluation points have to be of a certain structure.]]></description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2017.2659766</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Computer science ; Decoding ; Encoding ; Europe ; Gabidulin codes ; Indexes ; list decoding ; Rank-metric codes ; subspace codes ; subspace polynomials ; Technological innovation</subject><ispartof>IEEE transactions on information theory, 2017-04, Vol.63 (4), p.2623-2624</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c896-22fa0b0692f5f5db88081f80f5e1ae522bd34d9938fba70fdcf97b1e4da50703</cites><orcidid>0000-0002-1686-1994</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7879463$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/7879463$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Raviv, Netanel</creatorcontrib><creatorcontrib>Wachter-Zeh, Antonia</creatorcontrib><title>A Correction to "Some Gabidulin Codes Cannot be List Decoded Efficiently at any Radius"</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description><![CDATA[There is an error in the above titled paper <xref ref-type="bibr" rid="ref1">[1] . As a result, the main statement of the paper is true for a subset of the Gabidulin codes for which it was initially stated. To be precise, our results on the list decodability still hold for the same parameters of <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">m </tex-math></inline-formula>, but the evaluation points have to be of a certain structure.]]></description><subject>Computer science</subject><subject>Decoding</subject><subject>Encoding</subject><subject>Europe</subject><subject>Gabidulin codes</subject><subject>Indexes</subject><subject>list decoding</subject><subject>Rank-metric codes</subject><subject>subspace codes</subject><subject>subspace polynomials</subject><subject>Technological innovation</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kE1LAzEQhoMoWKt3wUuo512TbD6PZa21UBBswWPIbhJIaTc12T3037ulxdMwM887Aw8AzxiVGCP1tl1tS4KwKAlnSnB-AyaYMVEozugtmCCEZaEolffgIefd2FKGyQT8zGEdU3JtH2IH-whnm3hwcGmaYId96MatdRnWputiDxsH1yH38N2149jChfehDa7r9ydoemi6E_w2Ngx59gjuvNln93StU7D5WGzrz2L9tVzV83XRSsULQrxBDeKKeOaZbaREEnuJPHPYOEZIYytqlaqkb4xA3rZeiQY7ag1DAlVT8Hq5ekzxd3C517s4pG58qAkWtCICMz5S6EK1KeacnNfHFA4mnTRG-ixPj_L0WZ6-yhsjL5dIcM7940IKRXlV_QFJkWmR</recordid><startdate>201704</startdate><enddate>201704</enddate><creator>Raviv, Netanel</creator><creator>Wachter-Zeh, Antonia</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><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><orcidid>https://orcid.org/0000-0002-1686-1994</orcidid></search><sort><creationdate>201704</creationdate><title>A Correction to "Some Gabidulin Codes Cannot be List Decoded Efficiently at any Radius"</title><author>Raviv, Netanel ; Wachter-Zeh, Antonia</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c896-22fa0b0692f5f5db88081f80f5e1ae522bd34d9938fba70fdcf97b1e4da50703</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Computer science</topic><topic>Decoding</topic><topic>Encoding</topic><topic>Europe</topic><topic>Gabidulin codes</topic><topic>Indexes</topic><topic>list decoding</topic><topic>Rank-metric codes</topic><topic>subspace codes</topic><topic>subspace polynomials</topic><topic>Technological innovation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Raviv, Netanel</creatorcontrib><creatorcontrib>Wachter-Zeh, Antonia</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & 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>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Raviv, Netanel</au><au>Wachter-Zeh, Antonia</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Correction to "Some Gabidulin Codes Cannot be List Decoded Efficiently at any Radius"</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2017-04</date><risdate>2017</risdate><volume>63</volume><issue>4</issue><spage>2623</spage><epage>2624</epage><pages>2623-2624</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract><![CDATA[There is an error in the above titled paper <xref ref-type="bibr" rid="ref1">[1] . As a result, the main statement of the paper is true for a subset of the Gabidulin codes for which it was initially stated. To be precise, our results on the list decodability still hold for the same parameters of <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">m </tex-math></inline-formula>, but the evaluation points have to be of a certain structure.]]></abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TIT.2017.2659766</doi><tpages>2</tpages><orcidid>https://orcid.org/0000-0002-1686-1994</orcidid></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9448 |
| ispartof | IEEE transactions on information theory, 2017-04, Vol.63 (4), p.2623-2624 |
| issn | 0018-9448 1557-9654 |
| language | eng |
| recordid | cdi_ieee_primary_7879463 |
| source | IEEE Electronic Library (IEL) |
| subjects | Computer science Decoding Encoding Europe Gabidulin codes Indexes list decoding Rank-metric codes subspace codes subspace polynomials Technological innovation |
| title | A Correction to "Some Gabidulin Codes Cannot be List Decoded Efficiently at any Radius" |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T02%3A20%3A02IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Correction%20to%20%22Some%20Gabidulin%20Codes%20Cannot%20be%20List%20Decoded%20Efficiently%20at%20any%20Radius%22&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Raviv,%20Netanel&rft.date=2017-04&rft.volume=63&rft.issue=4&rft.spage=2623&rft.epage=2624&rft.pages=2623-2624&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2017.2659766&rft_dat=%3Cproquest_RIE%3E2174327156%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2174327156&rft_id=info:pmid/&rft_ieee_id=7879463&rfr_iscdi=true |