An Improved Decoding Algorithm to Decode Quadratic Residue Codes Based on the Difference of Syndromes
The paper proposes an improved difference-of-syndromes decoding algorithm for decoding quadratic residue codes up to half the minimum distance. Therein, soft-decision information is not essential, but it can be used to speed up the computations. The improvement over the prior art is demonstrated by...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory 2020-10, Vol.66 (10), p.5995-6000 |
|---|---|
| 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 | 6000 |
|---|---|
| container_issue | 10 |
| container_start_page | 5995 |
| container_title | IEEE transactions on information theory |
| container_volume | 66 |
| creator | Duan, Yunde Li, Yong |
| description | The paper proposes an improved difference-of-syndromes decoding algorithm for decoding quadratic residue codes up to half the minimum distance. Therein, soft-decision information is not essential, but it can be used to speed up the computations. The improvement over the prior art is demonstrated by simulations. Moreover, the proposed algorithm is also compared with the classic Berlekamp-Massey algorithm by taking two BCH codes as examples. |
| doi_str_mv | 10.1109/TIT.2020.2990421 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_2446058608</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9078851</ieee_id><sourcerecordid>2446058608</sourcerecordid><originalsourceid>FETCH-LOGICAL-c291t-661ce827343c4045ff600d137dd078f783e848cc0e9cda37a5b84259c08469c53</originalsourceid><addsrcrecordid>eNo9kN1LwzAUxYMoOKfvgi8Bnztv0qRNHufmx2Ag6nwuNbndOtZmJq2w_96MDp8u93DO_fgRcstgwhjoh9ViNeHAYcK1BsHZGRkxKfNEZ1KckxEAU4kWQl2SqxC2sRWS8RHBaUsXzd67X7R0jsbZul3T6W7tfN1tGtq5QUX63pfWl11t6AeG2vZIZ1EO9LEMMepa2m2QzuuqQo-tQeoq-nlorXcNhmtyUZW7gDenOiZfz0-r2WuyfHtZzKbLxHDNuiTLmEHF81SkRoCQVZUBWJbm1kKuqlylqIQyBlAbW6Z5Kb-V4FIbUCLTRqZjcj_MjQ_99Bi6Yut638aVBRciA6kyUNEFg8t4F4LHqtj7uin9oWBQHGEWEWZxhFmcYMbI3RCpEfHfruNVSrL0D0ylbvM</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2446058608</pqid></control><display><type>article</type><title>An Improved Decoding Algorithm to Decode Quadratic Residue Codes Based on the Difference of Syndromes</title><source>IEEE Electronic Library (IEL)</source><creator>Duan, Yunde ; Li, Yong</creator><creatorcontrib>Duan, Yunde ; Li, Yong</creatorcontrib><description>The paper proposes an improved difference-of-syndromes decoding algorithm for decoding quadratic residue codes up to half the minimum distance. Therein, soft-decision information is not essential, but it can be used to speed up the computations. The improvement over the prior art is demonstrated by simulations. Moreover, the proposed algorithm is also compared with the classic Berlekamp-Massey algorithm by taking two BCH codes as examples.</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2020.2990421</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; BCH codes ; Binary system ; Codes ; Computational complexity ; Computer science ; Computer simulation ; Decoding ; difference of syndromes ; Disorders ; error pattern ; Indexes ; Quadratic residue code ; Reliability ; Residues ; syndrome ; Systematics</subject><ispartof>IEEE transactions on information theory, 2020-10, Vol.66 (10), p.5995-6000</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c291t-661ce827343c4045ff600d137dd078f783e848cc0e9cda37a5b84259c08469c53</citedby><cites>FETCH-LOGICAL-c291t-661ce827343c4045ff600d137dd078f783e848cc0e9cda37a5b84259c08469c53</cites><orcidid>0000-0001-8338-6823 ; 0000-0003-1584-1622</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9078851$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/9078851$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Duan, Yunde</creatorcontrib><creatorcontrib>Li, Yong</creatorcontrib><title>An Improved Decoding Algorithm to Decode Quadratic Residue Codes Based on the Difference of Syndromes</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>The paper proposes an improved difference-of-syndromes decoding algorithm for decoding quadratic residue codes up to half the minimum distance. Therein, soft-decision information is not essential, but it can be used to speed up the computations. The improvement over the prior art is demonstrated by simulations. Moreover, the proposed algorithm is also compared with the classic Berlekamp-Massey algorithm by taking two BCH codes as examples.</description><subject>Algorithms</subject><subject>BCH codes</subject><subject>Binary system</subject><subject>Codes</subject><subject>Computational complexity</subject><subject>Computer science</subject><subject>Computer simulation</subject><subject>Decoding</subject><subject>difference of syndromes</subject><subject>Disorders</subject><subject>error pattern</subject><subject>Indexes</subject><subject>Quadratic residue code</subject><subject>Reliability</subject><subject>Residues</subject><subject>syndrome</subject><subject>Systematics</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kN1LwzAUxYMoOKfvgi8Bnztv0qRNHufmx2Ag6nwuNbndOtZmJq2w_96MDp8u93DO_fgRcstgwhjoh9ViNeHAYcK1BsHZGRkxKfNEZ1KckxEAU4kWQl2SqxC2sRWS8RHBaUsXzd67X7R0jsbZul3T6W7tfN1tGtq5QUX63pfWl11t6AeG2vZIZ1EO9LEMMepa2m2QzuuqQo-tQeoq-nlorXcNhmtyUZW7gDenOiZfz0-r2WuyfHtZzKbLxHDNuiTLmEHF81SkRoCQVZUBWJbm1kKuqlylqIQyBlAbW6Z5Kb-V4FIbUCLTRqZjcj_MjQ_99Bi6Yut638aVBRciA6kyUNEFg8t4F4LHqtj7uin9oWBQHGEWEWZxhFmcYMbI3RCpEfHfruNVSrL0D0ylbvM</recordid><startdate>20201001</startdate><enddate>20201001</enddate><creator>Duan, Yunde</creator><creator>Li, Yong</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-0001-8338-6823</orcidid><orcidid>https://orcid.org/0000-0003-1584-1622</orcidid></search><sort><creationdate>20201001</creationdate><title>An Improved Decoding Algorithm to Decode Quadratic Residue Codes Based on the Difference of Syndromes</title><author>Duan, Yunde ; Li, Yong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c291t-661ce827343c4045ff600d137dd078f783e848cc0e9cda37a5b84259c08469c53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Algorithms</topic><topic>BCH codes</topic><topic>Binary system</topic><topic>Codes</topic><topic>Computational complexity</topic><topic>Computer science</topic><topic>Computer simulation</topic><topic>Decoding</topic><topic>difference of syndromes</topic><topic>Disorders</topic><topic>error pattern</topic><topic>Indexes</topic><topic>Quadratic residue code</topic><topic>Reliability</topic><topic>Residues</topic><topic>syndrome</topic><topic>Systematics</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Duan, Yunde</creatorcontrib><creatorcontrib>Li, Yong</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>Duan, Yunde</au><au>Li, Yong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An Improved Decoding Algorithm to Decode Quadratic Residue Codes Based on the Difference of Syndromes</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2020-10-01</date><risdate>2020</risdate><volume>66</volume><issue>10</issue><spage>5995</spage><epage>6000</epage><pages>5995-6000</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>The paper proposes an improved difference-of-syndromes decoding algorithm for decoding quadratic residue codes up to half the minimum distance. Therein, soft-decision information is not essential, but it can be used to speed up the computations. The improvement over the prior art is demonstrated by simulations. Moreover, the proposed algorithm is also compared with the classic Berlekamp-Massey algorithm by taking two BCH codes as examples.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TIT.2020.2990421</doi><tpages>6</tpages><orcidid>https://orcid.org/0000-0001-8338-6823</orcidid><orcidid>https://orcid.org/0000-0003-1584-1622</orcidid></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9448 |
| ispartof | IEEE transactions on information theory, 2020-10, Vol.66 (10), p.5995-6000 |
| issn | 0018-9448 1557-9654 |
| language | eng |
| recordid | cdi_proquest_journals_2446058608 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithms BCH codes Binary system Codes Computational complexity Computer science Computer simulation Decoding difference of syndromes Disorders error pattern Indexes Quadratic residue code Reliability Residues syndrome Systematics |
| title | An Improved Decoding Algorithm to Decode Quadratic Residue Codes Based on the Difference of Syndromes |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-13T20%3A06%3A26IST&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=An%20Improved%20Decoding%20Algorithm%20to%20Decode%20Quadratic%20Residue%20Codes%20Based%20on%20the%20Difference%20of%20Syndromes&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Duan,%20Yunde&rft.date=2020-10-01&rft.volume=66&rft.issue=10&rft.spage=5995&rft.epage=6000&rft.pages=5995-6000&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2020.2990421&rft_dat=%3Cproquest_RIE%3E2446058608%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=2446058608&rft_id=info:pmid/&rft_ieee_id=9078851&rfr_iscdi=true |