A Hybrid Coding Scheme for the Gilbert-Elliott Channel
In this paper, we study the performance of different graph-based error-correcting codes over Gilbert-Elliot channels. We propose a hybrid coding scheme in which each code bit is checked by both a parity check and a Hamming code. A hybrid code can be represented by a code-to-code graph, which can be...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on communications 2006-09, Vol.54 (9), p.1703-1703 |
|---|---|
| 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 | 1703 |
|---|---|
| container_issue | 9 |
| container_start_page | 1703 |
| container_title | IEEE transactions on communications |
| container_volume | 54 |
| creator | Chen, J. Tanner, R.M. |
| description | In this paper, we study the performance of different graph-based error-correcting codes over Gilbert-Elliot channels. We propose a hybrid coding scheme in which each code bit is checked by both a parity check and a Hamming code. A hybrid code can be represented by a code-to-code graph, which can be used to optimize the code. Asymptotic minimum distance properties of the hybrid code are derived, and it is shown that the expected minimum distance of the hybrid code increases linearly with respect to the code length. Simulation results show that for a typical Gilbert-Elliott channel, hybrid codes can outperform regular low-density parity-check codes by more than an order of magnitude, in terms of bit-error rate. |
| doi_str_mv | 10.1109/TCOMM.2006.881270 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TCOMM_2006_881270</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1703829</ieee_id><sourcerecordid>2341203031</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1700-b595c3b28066fd086c471a155b98f079f1203acd30b7cf1be1e4576d2a14f1773</originalsourceid><addsrcrecordid>eNpdkD1PwzAQhi0EEqXwAxBLxMSSchcntjNWUT-QWnWgzFbinGmqNCl2OvTfkxIkJKYb7nlP7z2MPSJMECF93Wab9XoSAYiJUhhJuGIjTBIVgkrkNRsBpBAKKdUtu_N-DwAxcD5iYhosz4WryiBry6r5DN7Njg4U2NYF3Y6CRVUX5LpwVtdV23VBtsubhup7dmPz2tPD7xyzj_lsmy3D1Wbxlk1XoUEJEBZJmhheRAqEsCUoYWKJed-rSJUFmVqMgOem5FBIY7EgpDiRooxyjC1KycfsZbh7dO3XiXynD5U3VNd5Q-3JaxSyf1bEAD36_A_dtyfX9O20EgmPOYLoIRwg41rvHVl9dNUhd2eNoC8i9Y9IfRGpB5F95mnIVET0x_cbFaX8G4osa7k</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>865343106</pqid></control><display><type>article</type><title>A Hybrid Coding Scheme for the Gilbert-Elliott Channel</title><source>IEEE Electronic Library (IEL)</source><creator>Chen, J. ; Tanner, R.M.</creator><creatorcontrib>Chen, J. ; Tanner, R.M.</creatorcontrib><description>In this paper, we study the performance of different graph-based error-correcting codes over Gilbert-Elliot channels. We propose a hybrid coding scheme in which each code bit is checked by both a parity check and a Hamming code. A hybrid code can be represented by a code-to-code graph, which can be used to optimize the code. Asymptotic minimum distance properties of the hybrid code are derived, and it is shown that the expected minimum distance of the hybrid code increases linearly with respect to the code length. Simulation results show that for a typical Gilbert-Elliott channel, hybrid codes can outperform regular low-density parity-check codes by more than an order of magnitude, in terms of bit-error rate.</description><identifier>ISSN: 0090-6778</identifier><identifier>EISSN: 1558-0857</identifier><identifier>DOI: 10.1109/TCOMM.2006.881270</identifier><identifier>CODEN: IECMBT</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Antenna arrays ; Asymptotic properties ; Channel capacity ; Channel estimation ; Channels ; Coding ; Computational modeling ; Error correction ; Fading ; Graphs ; Hamming codes ; Parity ; Parity check codes ; Receiving antennas ; Scattering ; Simulation ; Transmitting antennas ; Working environment noise</subject><ispartof>IEEE transactions on communications, 2006-09, Vol.54 (9), p.1703-1703</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2006</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c1700-b595c3b28066fd086c471a155b98f079f1203acd30b7cf1be1e4576d2a14f1773</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1703829$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,778,782,794,27907,27908,54741</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1703829$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Chen, J.</creatorcontrib><creatorcontrib>Tanner, R.M.</creatorcontrib><title>A Hybrid Coding Scheme for the Gilbert-Elliott Channel</title><title>IEEE transactions on communications</title><addtitle>TCOMM</addtitle><description>In this paper, we study the performance of different graph-based error-correcting codes over Gilbert-Elliot channels. We propose a hybrid coding scheme in which each code bit is checked by both a parity check and a Hamming code. A hybrid code can be represented by a code-to-code graph, which can be used to optimize the code. Asymptotic minimum distance properties of the hybrid code are derived, and it is shown that the expected minimum distance of the hybrid code increases linearly with respect to the code length. Simulation results show that for a typical Gilbert-Elliott channel, hybrid codes can outperform regular low-density parity-check codes by more than an order of magnitude, in terms of bit-error rate.</description><subject>Antenna arrays</subject><subject>Asymptotic properties</subject><subject>Channel capacity</subject><subject>Channel estimation</subject><subject>Channels</subject><subject>Coding</subject><subject>Computational modeling</subject><subject>Error correction</subject><subject>Fading</subject><subject>Graphs</subject><subject>Hamming codes</subject><subject>Parity</subject><subject>Parity check codes</subject><subject>Receiving antennas</subject><subject>Scattering</subject><subject>Simulation</subject><subject>Transmitting antennas</subject><subject>Working environment noise</subject><issn>0090-6778</issn><issn>1558-0857</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpdkD1PwzAQhi0EEqXwAxBLxMSSchcntjNWUT-QWnWgzFbinGmqNCl2OvTfkxIkJKYb7nlP7z2MPSJMECF93Wab9XoSAYiJUhhJuGIjTBIVgkrkNRsBpBAKKdUtu_N-DwAxcD5iYhosz4WryiBry6r5DN7Njg4U2NYF3Y6CRVUX5LpwVtdV23VBtsubhup7dmPz2tPD7xyzj_lsmy3D1Wbxlk1XoUEJEBZJmhheRAqEsCUoYWKJed-rSJUFmVqMgOem5FBIY7EgpDiRooxyjC1KycfsZbh7dO3XiXynD5U3VNd5Q-3JaxSyf1bEAD36_A_dtyfX9O20EgmPOYLoIRwg41rvHVl9dNUhd2eNoC8i9Y9IfRGpB5F95mnIVET0x_cbFaX8G4osa7k</recordid><startdate>20060901</startdate><enddate>20060901</enddate><creator>Chen, J.</creator><creator>Tanner, R.M.</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>7SP</scope><scope>8FD</scope><scope>L7M</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20060901</creationdate><title>A Hybrid Coding Scheme for the Gilbert-Elliott Channel</title><author>Chen, J. ; Tanner, R.M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1700-b595c3b28066fd086c471a155b98f079f1203acd30b7cf1be1e4576d2a14f1773</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Antenna arrays</topic><topic>Asymptotic properties</topic><topic>Channel capacity</topic><topic>Channel estimation</topic><topic>Channels</topic><topic>Coding</topic><topic>Computational modeling</topic><topic>Error correction</topic><topic>Fading</topic><topic>Graphs</topic><topic>Hamming codes</topic><topic>Parity</topic><topic>Parity check codes</topic><topic>Receiving antennas</topic><topic>Scattering</topic><topic>Simulation</topic><topic>Transmitting antennas</topic><topic>Working environment noise</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Chen, J.</creatorcontrib><creatorcontrib>Tanner, R.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>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 transactions on communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Chen, J.</au><au>Tanner, R.M.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Hybrid Coding Scheme for the Gilbert-Elliott Channel</atitle><jtitle>IEEE transactions on communications</jtitle><stitle>TCOMM</stitle><date>2006-09-01</date><risdate>2006</risdate><volume>54</volume><issue>9</issue><spage>1703</spage><epage>1703</epage><pages>1703-1703</pages><issn>0090-6778</issn><eissn>1558-0857</eissn><coden>IECMBT</coden><abstract>In this paper, we study the performance of different graph-based error-correcting codes over Gilbert-Elliot channels. We propose a hybrid coding scheme in which each code bit is checked by both a parity check and a Hamming code. A hybrid code can be represented by a code-to-code graph, which can be used to optimize the code. Asymptotic minimum distance properties of the hybrid code are derived, and it is shown that the expected minimum distance of the hybrid code increases linearly with respect to the code length. Simulation results show that for a typical Gilbert-Elliott channel, hybrid codes can outperform regular low-density parity-check codes by more than an order of magnitude, in terms of bit-error rate.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TCOMM.2006.881270</doi><tpages>1</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0090-6778 |
| ispartof | IEEE transactions on communications, 2006-09, Vol.54 (9), p.1703-1703 |
| issn | 0090-6778 1558-0857 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_TCOMM_2006_881270 |
| source | IEEE Electronic Library (IEL) |
| subjects | Antenna arrays Asymptotic properties Channel capacity Channel estimation Channels Coding Computational modeling Error correction Fading Graphs Hamming codes Parity Parity check codes Receiving antennas Scattering Simulation Transmitting antennas Working environment noise |
| title | A Hybrid Coding Scheme for the Gilbert-Elliott Channel |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T20%3A00%3A23IST&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%20Hybrid%20Coding%20Scheme%20for%20the%20Gilbert-Elliott%20Channel&rft.jtitle=IEEE%20transactions%20on%20communications&rft.au=Chen,%20J.&rft.date=2006-09-01&rft.volume=54&rft.issue=9&rft.spage=1703&rft.epage=1703&rft.pages=1703-1703&rft.issn=0090-6778&rft.eissn=1558-0857&rft.coden=IECMBT&rft_id=info:doi/10.1109/TCOMM.2006.881270&rft_dat=%3Cproquest_RIE%3E2341203031%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=865343106&rft_id=info:pmid/&rft_ieee_id=1703829&rfr_iscdi=true |