Minimum-redundancy codes for correcting a single (wrap-around) burst of erasures
We give recursive constructions, valid for any field, of [n,k] codes capable of correcting a (wrap-around) burst of n - k erasures.
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1052 |
|---|---|
| container_issue | |
| container_start_page | 1050 |
| container_title | |
| container_volume | |
| creator | Hollmann, H.D.L. Tolhuizen, L.M. |
| description | We give recursive constructions, valid for any field, of [n,k] codes capable of correcting a (wrap-around) burst of n - k erasures. |
| doi_str_mv | 10.1109/ISIT.2008.4595147 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4595147</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4595147</ieee_id><sourcerecordid>4595147</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-8dcc455153d20679a2ca8caadfbd4c774d548e74ef0b096b275938d59b977e393</originalsourceid><addsrcrecordid>eNpVkE1LAzEYhONHwaXuDxAvOeohNV_vvslRih-FioL1XLJJVlba3ZJ0kf57F6wH5zIDzzCHIeRK8JkQ3N4t3hermeTczDRYEBpPSGnRCC21lhLQnpJCCkBmhMCzf6yS53-MW5iQAiUTaLXCC1Lm_MVHaVBSm4K8vbRdux22LMUwdMF1_kB9H2KmTZ_GlFL0-7b7pI7m0TaR3nwnt2Mu9WP9ltZDynvaNzQml4cU8yWZNG6TY3n0Kfl4fFjNn9ny9Wkxv1-yViDsmQneawABKkheoXXSO-OdC00dtEfUAbSJqGPDa26rWiJYZQLY2iJGZdWUXP_utjHG9S61W5cO6-NX6gdVCFa9</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Minimum-redundancy codes for correcting a single (wrap-around) burst of erasures</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Hollmann, H.D.L. ; Tolhuizen, L.M.</creator><creatorcontrib>Hollmann, H.D.L. ; Tolhuizen, L.M.</creatorcontrib><description>We give recursive constructions, valid for any field, of [n,k] codes capable of correcting a (wrap-around) burst of n - k erasures.</description><identifier>ISSN: 2157-8095</identifier><identifier>ISBN: 9781424422562</identifier><identifier>ISBN: 1424422566</identifier><identifier>EISSN: 2157-8117</identifier><identifier>EISBN: 9781424422579</identifier><identifier>EISBN: 1424422574</identifier><identifier>DOI: 10.1109/ISIT.2008.4595147</identifier><identifier>LCCN: 72-179437</identifier><language>eng</language><publisher>IEEE</publisher><subject>Construction industry ; Electronic mail ; Equations ; Generators ; Linear code ; Parity check codes ; Terminology</subject><ispartof>2008 IEEE International Symposium on Information Theory, 2008, p.1050-1052</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4595147$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4595147$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Hollmann, H.D.L.</creatorcontrib><creatorcontrib>Tolhuizen, L.M.</creatorcontrib><title>Minimum-redundancy codes for correcting a single (wrap-around) burst of erasures</title><title>2008 IEEE International Symposium on Information Theory</title><addtitle>ISIT</addtitle><description>We give recursive constructions, valid for any field, of [n,k] codes capable of correcting a (wrap-around) burst of n - k erasures.</description><subject>Construction industry</subject><subject>Electronic mail</subject><subject>Equations</subject><subject>Generators</subject><subject>Linear code</subject><subject>Parity check codes</subject><subject>Terminology</subject><issn>2157-8095</issn><issn>2157-8117</issn><isbn>9781424422562</isbn><isbn>1424422566</isbn><isbn>9781424422579</isbn><isbn>1424422574</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2008</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpVkE1LAzEYhONHwaXuDxAvOeohNV_vvslRih-FioL1XLJJVlba3ZJ0kf57F6wH5zIDzzCHIeRK8JkQ3N4t3hermeTczDRYEBpPSGnRCC21lhLQnpJCCkBmhMCzf6yS53-MW5iQAiUTaLXCC1Lm_MVHaVBSm4K8vbRdux22LMUwdMF1_kB9H2KmTZ_GlFL0-7b7pI7m0TaR3nwnt2Mu9WP9ltZDynvaNzQml4cU8yWZNG6TY3n0Kfl4fFjNn9ny9Wkxv1-yViDsmQneawABKkheoXXSO-OdC00dtEfUAbSJqGPDa26rWiJYZQLY2iJGZdWUXP_utjHG9S61W5cO6-NX6gdVCFa9</recordid><startdate>200807</startdate><enddate>200807</enddate><creator>Hollmann, H.D.L.</creator><creator>Tolhuizen, L.M.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>200807</creationdate><title>Minimum-redundancy codes for correcting a single (wrap-around) burst of erasures</title><author>Hollmann, H.D.L. ; Tolhuizen, L.M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-8dcc455153d20679a2ca8caadfbd4c774d548e74ef0b096b275938d59b977e393</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Construction industry</topic><topic>Electronic mail</topic><topic>Equations</topic><topic>Generators</topic><topic>Linear code</topic><topic>Parity check codes</topic><topic>Terminology</topic><toplevel>online_resources</toplevel><creatorcontrib>Hollmann, H.D.L.</creatorcontrib><creatorcontrib>Tolhuizen, L.M.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Hollmann, H.D.L.</au><au>Tolhuizen, L.M.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Minimum-redundancy codes for correcting a single (wrap-around) burst of erasures</atitle><btitle>2008 IEEE International Symposium on Information Theory</btitle><stitle>ISIT</stitle><date>2008-07</date><risdate>2008</risdate><spage>1050</spage><epage>1052</epage><pages>1050-1052</pages><issn>2157-8095</issn><eissn>2157-8117</eissn><isbn>9781424422562</isbn><isbn>1424422566</isbn><eisbn>9781424422579</eisbn><eisbn>1424422574</eisbn><abstract>We give recursive constructions, valid for any field, of [n,k] codes capable of correcting a (wrap-around) burst of n - k erasures.</abstract><pub>IEEE</pub><doi>10.1109/ISIT.2008.4595147</doi><tpages>3</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2157-8095 |
| ispartof | 2008 IEEE International Symposium on Information Theory, 2008, p.1050-1052 |
| issn | 2157-8095 2157-8117 |
| language | eng |
| recordid | cdi_ieee_primary_4595147 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Construction industry Electronic mail Equations Generators Linear code Parity check codes Terminology |
| title | Minimum-redundancy codes for correcting a single (wrap-around) burst of erasures |
| 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%3A10%3A57IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Minimum-redundancy%20codes%20for%20correcting%20a%20single%20(wrap-around)%20burst%20of%20erasures&rft.btitle=2008%20IEEE%20International%20Symposium%20on%20Information%20Theory&rft.au=Hollmann,%20H.D.L.&rft.date=2008-07&rft.spage=1050&rft.epage=1052&rft.pages=1050-1052&rft.issn=2157-8095&rft.eissn=2157-8117&rft.isbn=9781424422562&rft.isbn_list=1424422566&rft_id=info:doi/10.1109/ISIT.2008.4595147&rft_dat=%3Cieee_6IE%3E4595147%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424422579&rft.eisbn_list=1424422574&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4595147&rfr_iscdi=true |