Optimal codes for correcting a single (wrap-around) burst of errors

Optimal codes for correcting a single (wrap-around) burst of errors

In 2007, Martinian and Trott presented codes for correcting a burst of erasures with a minimum decoding delay. Their construction employs [n,k] codes that can correct any burst of erasures (including wrap-around bursts) of length n-k. The raised the question if such [n,k] codes exist for all integer...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2007-12
Hauptverfasser: Hollmann, Henk D L, Ludo M G M Tolhuizen
Format: Artikel
Sprache:eng
Schlagworte:
Codes
Decoding
Integers
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Hollmann, Henk D L
Ludo M G M Tolhuizen
description In 2007, Martinian and Trott presented codes for correcting a burst of erasures with a minimum decoding delay. Their construction employs [n,k] codes that can correct any burst of erasures (including wrap-around bursts) of length n-k. The raised the question if such [n,k] codes exist for all integers k and n with 1
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2092178951</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2092178951</sourcerecordid><originalsourceid>FETCH-proquest_journals_20921789513</originalsourceid><addsrcrecordid>eNqNisEKgkAQQJcgSMp_GOhSB2GdzdSzFN26dI9N11DMsZld-v089AGd3oP3FipCY9KkOCCuVCzSa63xmGOWmUhV18l3LztATY0TaIlnY3a178YnWJAZg4Pdh-2UWKYwNnt4BBYP1IJjJpaNWrZ2EBf_uFbb8-lWXZKJ6R2c-HtPgcc53VGXmOZFmaXmv-sL1SU54Q</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2092178951</pqid></control><display><type>article</type><title>Optimal codes for correcting a single (wrap-around) burst of errors</title><source>Free E- Journals</source><creator>Hollmann, Henk D L ; Ludo M G M Tolhuizen</creator><creatorcontrib>Hollmann, Henk D L ; Ludo M G M Tolhuizen</creatorcontrib><description>In 2007, Martinian and Trott presented codes for correcting a burst of erasures with a minimum decoding delay. Their construction employs [n,k] codes that can correct any burst of erasures (including wrap-around bursts) of length n-k. The raised the question if such [n,k] codes exist for all integers k and n with 1&lt;= k &lt;= n and all fields (in particular, for the binary field). In this note, we answer this question affirmatively by giving two recursive constructions and a direct one.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Codes ; Decoding ; Integers</subject><ispartof>arXiv.org, 2007-12</ispartof><rights>Notwithstanding the ProQuest Terms and conditions, you may use this content in accordance with the associated terms available at http://arxiv.org/abs/0712.2182.</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>780,784</link.rule.ids></links><search><creatorcontrib>Hollmann, Henk D L</creatorcontrib><creatorcontrib>Ludo M G M Tolhuizen</creatorcontrib><title>Optimal codes for correcting a single (wrap-around) burst of errors</title><title>arXiv.org</title><description>In 2007, Martinian and Trott presented codes for correcting a burst of erasures with a minimum decoding delay. Their construction employs [n,k] codes that can correct any burst of erasures (including wrap-around bursts) of length n-k. The raised the question if such [n,k] codes exist for all integers k and n with 1&lt;= k &lt;= n and all fields (in particular, for the binary field). In this note, we answer this question affirmatively by giving two recursive constructions and a direct one.</description><subject>Codes</subject><subject>Decoding</subject><subject>Integers</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNqNisEKgkAQQJcgSMp_GOhSB2GdzdSzFN26dI9N11DMsZld-v089AGd3oP3FipCY9KkOCCuVCzSa63xmGOWmUhV18l3LztATY0TaIlnY3a178YnWJAZg4Pdh-2UWKYwNnt4BBYP1IJjJpaNWrZ2EBf_uFbb8-lWXZKJ6R2c-HtPgcc53VGXmOZFmaXmv-sL1SU54Q</recordid><startdate>20071213</startdate><enddate>20071213</enddate><creator>Hollmann, Henk D L</creator><creator>Ludo M G M Tolhuizen</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20071213</creationdate><title>Optimal codes for correcting a single (wrap-around) burst of errors</title><author>Hollmann, Henk D L ; Ludo M G M Tolhuizen</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20921789513</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Codes</topic><topic>Decoding</topic><topic>Integers</topic><toplevel>online_resources</toplevel><creatorcontrib>Hollmann, Henk D L</creatorcontrib><creatorcontrib>Ludo M G M Tolhuizen</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hollmann, Henk D L</au><au>Ludo M G M Tolhuizen</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Optimal codes for correcting a single (wrap-around) burst of errors</atitle><jtitle>arXiv.org</jtitle><date>2007-12-13</date><risdate>2007</risdate><eissn>2331-8422</eissn><abstract>In 2007, Martinian and Trott presented codes for correcting a burst of erasures with a minimum decoding delay. Their construction employs [n,k] codes that can correct any burst of erasures (including wrap-around bursts) of length n-k. The raised the question if such [n,k] codes exist for all integers k and n with 1&lt;= k &lt;= n and all fields (in particular, for the binary field). In this note, we answer this question affirmatively by giving two recursive constructions and a direct one.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2007-12
issn 2331-8422
language eng
recordid cdi_proquest_journals_2092178951
source Free E- Journals
subjects Codes
Decoding
Integers
title Optimal codes for correcting a single (wrap-around) burst of errors
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-03T23%3A51%3A02IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Optimal%20codes%20for%20correcting%20a%20single%20(wrap-around)%20burst%20of%20errors&rft.jtitle=arXiv.org&rft.au=Hollmann,%20Henk%20D%20L&rft.date=2007-12-13&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2092178951%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2092178951&rft_id=info:pmid/&rfr_iscdi=true