Efficient Shortened Cyclic Codes Correcting Either Random Errors or Bursts
Efficient cyclic or shortened cyclic codes that can correct either up to t errors or a single burst of length up to b, where t
Gespeichert in:
| Veröffentlicht in: | IEEE communications letters 2011-07, Vol.15 (7), p.749-751 |
|---|---|
| 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 | 751 |
|---|---|
| container_issue | 7 |
| container_start_page | 749 |
| container_title | IEEE communications letters |
| container_volume | 15 |
| creator | Villalba, L. J. G. Cortez, J. R. F. Orozco, A. L. S. Blaum, M. |
| description | Efficient cyclic or shortened cyclic codes that can correct either up to t errors or a single burst of length up to b, where t |
| doi_str_mv | 10.1109/LCOMM.2011.060111.110338 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_5871405</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5871405</ieee_id><sourcerecordid>2492929231</sourcerecordid><originalsourceid>FETCH-LOGICAL-c368t-f3ea701cff3a612932680ebbd15f76d33be087a1ab1d19c9405ea0557e1a3af23</originalsourceid><addsrcrecordid>eNpdkMFO3DAQhqMKpFLoE3CxKlU9ZTtjr2PnWKItbbWrlaCcLa8zLkbZGOzsgbevlyAOXH5bnm9Gnq-qGMICEdrv62672Sw4IC6gKYnHZyH0h-oMpdQ1L3FS7qDbWqlWf6w-5fwAAJpLPKv-rLwPLtA4sdv7mCYaqWfdsxuCY13sKZdMidwUxn9sFaZ7SuzGjn3cs1VKMWUWE7s6pDzli-rU2yHT59fzvLr7ufrb_arX2-vf3Y917USjp9oLsgrQeS9sg7wVvNFAu12P0qumF2JHoJVFu8MeW9cuQZIFKRWhFdZzcV59m-c-pvh0oDyZfciOhsGOFA_ZtICNQkBdyC_vyId4SGP5XIGOwBKWBdIz5FLMOZE3jynsbXo2COao2LwoNkfFZlZsZsWl9evrfJudHXyyowv5rZ8vBVeSy8Jdzlwgorey1ArLcuI_gbeEJA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>900183404</pqid></control><display><type>article</type><title>Efficient Shortened Cyclic Codes Correcting Either Random Errors or Bursts</title><source>IEEE Electronic Library (IEL)</source><creator>Villalba, L. J. G. ; Cortez, J. R. F. ; Orozco, A. L. S. ; Blaum, M.</creator><creatorcontrib>Villalba, L. J. G. ; Cortez, J. R. F. ; Orozco, A. L. S. ; Blaum, M.</creatorcontrib><description>Efficient cyclic or shortened cyclic codes that can correct either up to t errors or a single burst of length up to b, where t <; b, are presented, as well as a search algorithm based on syndrome computation for each possible generator polynomial. Previously known results are improved by the new codes.</description><identifier>ISSN: 1089-7798</identifier><identifier>EISSN: 1558-2558</identifier><identifier>DOI: 10.1109/LCOMM.2011.060111.110338</identifier><identifier>CODEN: ICLEF6</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Block codes ; burst errors ; burst-correcting codes ; Bursts ; Coding, codes ; Computation ; Computers ; Error correction ; Error correction codes ; Error-correcting codes ; Exact sciences and technology ; Generators ; Information, signal and communications theory ; Polynomials ; Random errors ; Scholarships ; Search algorithms ; shortened cyclic codes ; Signal and communications theory ; Systematics ; Telecommunications and information theory</subject><ispartof>IEEE communications letters, 2011-07, Vol.15 (7), p.749-751</ispartof><rights>2015 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jul 2011</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c368t-f3ea701cff3a612932680ebbd15f76d33be087a1ab1d19c9405ea0557e1a3af23</citedby><cites>FETCH-LOGICAL-c368t-f3ea701cff3a612932680ebbd15f76d33be087a1ab1d19c9405ea0557e1a3af23</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5871405$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,777,781,793,27905,27906,54739</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5871405$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=24327525$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Villalba, L. J. G.</creatorcontrib><creatorcontrib>Cortez, J. R. F.</creatorcontrib><creatorcontrib>Orozco, A. L. S.</creatorcontrib><creatorcontrib>Blaum, M.</creatorcontrib><title>Efficient Shortened Cyclic Codes Correcting Either Random Errors or Bursts</title><title>IEEE communications letters</title><addtitle>COML</addtitle><description>Efficient cyclic or shortened cyclic codes that can correct either up to t errors or a single burst of length up to b, where t <; b, are presented, as well as a search algorithm based on syndrome computation for each possible generator polynomial. Previously known results are improved by the new codes.</description><subject>Applied sciences</subject><subject>Block codes</subject><subject>burst errors</subject><subject>burst-correcting codes</subject><subject>Bursts</subject><subject>Coding, codes</subject><subject>Computation</subject><subject>Computers</subject><subject>Error correction</subject><subject>Error correction codes</subject><subject>Error-correcting codes</subject><subject>Exact sciences and technology</subject><subject>Generators</subject><subject>Information, signal and communications theory</subject><subject>Polynomials</subject><subject>Random errors</subject><subject>Scholarships</subject><subject>Search algorithms</subject><subject>shortened cyclic codes</subject><subject>Signal and communications theory</subject><subject>Systematics</subject><subject>Telecommunications and information theory</subject><issn>1089-7798</issn><issn>1558-2558</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpdkMFO3DAQhqMKpFLoE3CxKlU9ZTtjr2PnWKItbbWrlaCcLa8zLkbZGOzsgbevlyAOXH5bnm9Gnq-qGMICEdrv62672Sw4IC6gKYnHZyH0h-oMpdQ1L3FS7qDbWqlWf6w-5fwAAJpLPKv-rLwPLtA4sdv7mCYaqWfdsxuCY13sKZdMidwUxn9sFaZ7SuzGjn3cs1VKMWUWE7s6pDzli-rU2yHT59fzvLr7ufrb_arX2-vf3Y917USjp9oLsgrQeS9sg7wVvNFAu12P0qumF2JHoJVFu8MeW9cuQZIFKRWhFdZzcV59m-c-pvh0oDyZfciOhsGOFA_ZtICNQkBdyC_vyId4SGP5XIGOwBKWBdIz5FLMOZE3jynsbXo2COao2LwoNkfFZlZsZsWl9evrfJudHXyyowv5rZ8vBVeSy8Jdzlwgorey1ArLcuI_gbeEJA</recordid><startdate>20110701</startdate><enddate>20110701</enddate><creator>Villalba, L. J. G.</creator><creator>Cortez, J. R. F.</creator><creator>Orozco, A. L. S.</creator><creator>Blaum, M.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20110701</creationdate><title>Efficient Shortened Cyclic Codes Correcting Either Random Errors or Bursts</title><author>Villalba, L. J. G. ; Cortez, J. R. F. ; Orozco, A. L. S. ; Blaum, M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c368t-f3ea701cff3a612932680ebbd15f76d33be087a1ab1d19c9405ea0557e1a3af23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Applied sciences</topic><topic>Block codes</topic><topic>burst errors</topic><topic>burst-correcting codes</topic><topic>Bursts</topic><topic>Coding, codes</topic><topic>Computation</topic><topic>Computers</topic><topic>Error correction</topic><topic>Error correction codes</topic><topic>Error-correcting codes</topic><topic>Exact sciences and technology</topic><topic>Generators</topic><topic>Information, signal and communications theory</topic><topic>Polynomials</topic><topic>Random errors</topic><topic>Scholarships</topic><topic>Search algorithms</topic><topic>shortened cyclic codes</topic><topic>Signal and communications theory</topic><topic>Systematics</topic><topic>Telecommunications and information theory</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Villalba, L. J. G.</creatorcontrib><creatorcontrib>Cortez, J. R. F.</creatorcontrib><creatorcontrib>Orozco, A. L. S.</creatorcontrib><creatorcontrib>Blaum, M.</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>Pascal-Francis</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE communications letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Villalba, L. J. G.</au><au>Cortez, J. R. F.</au><au>Orozco, A. L. S.</au><au>Blaum, M.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Efficient Shortened Cyclic Codes Correcting Either Random Errors or Bursts</atitle><jtitle>IEEE communications letters</jtitle><stitle>COML</stitle><date>2011-07-01</date><risdate>2011</risdate><volume>15</volume><issue>7</issue><spage>749</spage><epage>751</epage><pages>749-751</pages><issn>1089-7798</issn><eissn>1558-2558</eissn><coden>ICLEF6</coden><abstract>Efficient cyclic or shortened cyclic codes that can correct either up to t errors or a single burst of length up to b, where t <; b, are presented, as well as a search algorithm based on syndrome computation for each possible generator polynomial. Previously known results are improved by the new codes.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/LCOMM.2011.060111.110338</doi><tpages>3</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1089-7798 |
| ispartof | IEEE communications letters, 2011-07, Vol.15 (7), p.749-751 |
| issn | 1089-7798 1558-2558 |
| language | eng |
| recordid | cdi_ieee_primary_5871405 |
| source | IEEE Electronic Library (IEL) |
| subjects | Applied sciences Block codes burst errors burst-correcting codes Bursts Coding, codes Computation Computers Error correction Error correction codes Error-correcting codes Exact sciences and technology Generators Information, signal and communications theory Polynomials Random errors Scholarships Search algorithms shortened cyclic codes Signal and communications theory Systematics Telecommunications and information theory |
| title | Efficient Shortened Cyclic Codes Correcting Either Random Errors or Bursts |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T12%3A57%3A37IST&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=Efficient%20Shortened%20Cyclic%20Codes%20Correcting%20Either%20Random%20Errors%20or%20Bursts&rft.jtitle=IEEE%20communications%20letters&rft.au=Villalba,%20L.%20J.%20G.&rft.date=2011-07-01&rft.volume=15&rft.issue=7&rft.spage=749&rft.epage=751&rft.pages=749-751&rft.issn=1089-7798&rft.eissn=1558-2558&rft.coden=ICLEF6&rft_id=info:doi/10.1109/LCOMM.2011.060111.110338&rft_dat=%3Cproquest_RIE%3E2492929231%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=900183404&rft_id=info:pmid/&rft_ieee_id=5871405&rfr_iscdi=true |