Convolutional codes from "optimal" linear block codes
Both non-recursive and recursive (i.e. turbo codes) convolutional codes (CCs) require careful choices of generators to obtain codes with large minimum distance and ultimately low bit error rate for a given channel characteristic. We first give a constructive method for building a generator matrix of...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| 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 | 857 vol.2 |
|---|---|
| container_issue | |
| container_start_page | 853 |
| container_title | |
| container_volume | |
| creator | Ray, G.A. |
| description | Both non-recursive and recursive (i.e. turbo codes) convolutional codes (CCs) require careful choices of generators to obtain codes with large minimum distance and ultimately low bit error rate for a given channel characteristic. We first give a constructive method for building a generator matrix of either type of convolutional code based on certain low rate high distance linear block codes. For non-recursive CCs, these linear block codes have optimal dimension given block length n and minimum distance d if 2d>n. For recursive CCs, the linear block codes are constructed to appear random as determined by certain randomness tests. |
| doi_str_mv | 10.1109/ACSSC.1996.599065 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_599065</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>599065</ieee_id><sourcerecordid>599065</sourcerecordid><originalsourceid>FETCH-LOGICAL-i172t-9d9ab537786e9373c1df450b4bab98f825e20e8937ad5a2008a2bacb3de7d3543</originalsourceid><addsrcrecordid>eNotj01LxDAYhIMfYFn7A_QU9t76Jm8-j0vxCxY8rJ6XpEmhmm2Wtgr-ewt1LnN4hmGGkDsGNWNgH3bN4dDUzFpVS2tByQtScKlVxRHwkpRWGzDMKK2EMlekYCBNpdDiDSmn6RMWCRQLL4hs8vCT0_fc58El2uYQJ9qN-US3-Tz3J5e2NPVDdCP1Kbdfa-KWXHcuTbH89w35eHp8b16q_dvza7PbVz3TfK5ssM5L1NqoaFFjy0InJHjhnbemM1xGDtEsyAXpOIBx3LvWY4g6oBS4Ifdrbx9jPJ7HZc_4e1w_4x-lrkfa</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Convolutional codes from "optimal" linear block codes</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Ray, G.A.</creator><creatorcontrib>Ray, G.A.</creatorcontrib><description>Both non-recursive and recursive (i.e. turbo codes) convolutional codes (CCs) require careful choices of generators to obtain codes with large minimum distance and ultimately low bit error rate for a given channel characteristic. We first give a constructive method for building a generator matrix of either type of convolutional code based on certain low rate high distance linear block codes. For non-recursive CCs, these linear block codes have optimal dimension given block length n and minimum distance d if 2d>n. For recursive CCs, the linear block codes are constructed to appear random as determined by certain randomness tests.</description><identifier>ISSN: 1058-6393</identifier><identifier>ISBN: 9780818676468</identifier><identifier>ISBN: 0818676469</identifier><identifier>EISSN: 2576-2303</identifier><identifier>DOI: 10.1109/ACSSC.1996.599065</identifier><language>eng</language><publisher>IEEE</publisher><subject>Block codes ; Clouds ; Convolutional codes ; Decoding ; Ear ; Linear code ; Sampling methods ; Shape ; Turbo codes ; Upper bound</subject><ispartof>Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers, 1996, p.853-857 vol.2</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/599065$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,4050,4051,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/599065$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Ray, G.A.</creatorcontrib><title>Convolutional codes from "optimal" linear block codes</title><title>Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers</title><addtitle>ACSSC</addtitle><description>Both non-recursive and recursive (i.e. turbo codes) convolutional codes (CCs) require careful choices of generators to obtain codes with large minimum distance and ultimately low bit error rate for a given channel characteristic. We first give a constructive method for building a generator matrix of either type of convolutional code based on certain low rate high distance linear block codes. For non-recursive CCs, these linear block codes have optimal dimension given block length n and minimum distance d if 2d>n. For recursive CCs, the linear block codes are constructed to appear random as determined by certain randomness tests.</description><subject>Block codes</subject><subject>Clouds</subject><subject>Convolutional codes</subject><subject>Decoding</subject><subject>Ear</subject><subject>Linear code</subject><subject>Sampling methods</subject><subject>Shape</subject><subject>Turbo codes</subject><subject>Upper bound</subject><issn>1058-6393</issn><issn>2576-2303</issn><isbn>9780818676468</isbn><isbn>0818676469</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1996</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj01LxDAYhIMfYFn7A_QU9t76Jm8-j0vxCxY8rJ6XpEmhmm2Wtgr-ewt1LnN4hmGGkDsGNWNgH3bN4dDUzFpVS2tByQtScKlVxRHwkpRWGzDMKK2EMlekYCBNpdDiDSmn6RMWCRQLL4hs8vCT0_fc58El2uYQJ9qN-US3-Tz3J5e2NPVDdCP1Kbdfa-KWXHcuTbH89w35eHp8b16q_dvza7PbVz3TfK5ssM5L1NqoaFFjy0InJHjhnbemM1xGDtEsyAXpOIBx3LvWY4g6oBS4Ifdrbx9jPJ7HZc_4e1w_4x-lrkfa</recordid><startdate>1996</startdate><enddate>1996</enddate><creator>Ray, G.A.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>1996</creationdate><title>Convolutional codes from "optimal" linear block codes</title><author>Ray, G.A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i172t-9d9ab537786e9373c1df450b4bab98f825e20e8937ad5a2008a2bacb3de7d3543</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1996</creationdate><topic>Block codes</topic><topic>Clouds</topic><topic>Convolutional codes</topic><topic>Decoding</topic><topic>Ear</topic><topic>Linear code</topic><topic>Sampling methods</topic><topic>Shape</topic><topic>Turbo codes</topic><topic>Upper bound</topic><toplevel>online_resources</toplevel><creatorcontrib>Ray, G.A.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Ray, G.A.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Convolutional codes from "optimal" linear block codes</atitle><btitle>Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers</btitle><stitle>ACSSC</stitle><date>1996</date><risdate>1996</risdate><spage>853</spage><epage>857 vol.2</epage><pages>853-857 vol.2</pages><issn>1058-6393</issn><eissn>2576-2303</eissn><isbn>9780818676468</isbn><isbn>0818676469</isbn><abstract>Both non-recursive and recursive (i.e. turbo codes) convolutional codes (CCs) require careful choices of generators to obtain codes with large minimum distance and ultimately low bit error rate for a given channel characteristic. We first give a constructive method for building a generator matrix of either type of convolutional code based on certain low rate high distance linear block codes. For non-recursive CCs, these linear block codes have optimal dimension given block length n and minimum distance d if 2d>n. For recursive CCs, the linear block codes are constructed to appear random as determined by certain randomness tests.</abstract><pub>IEEE</pub><doi>10.1109/ACSSC.1996.599065</doi></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1058-6393 |
| ispartof | Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers, 1996, p.853-857 vol.2 |
| issn | 1058-6393 2576-2303 |
| language | eng |
| recordid | cdi_ieee_primary_599065 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Block codes Clouds Convolutional codes Decoding Ear Linear code Sampling methods Shape Turbo codes Upper bound |
| title | Convolutional codes from "optimal" linear block codes |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T23%3A59%3A47IST&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=Convolutional%20codes%20from%20%22optimal%22%20linear%20block%20codes&rft.btitle=Conference%20Record%20of%20The%20Thirtieth%20Asilomar%20Conference%20on%20Signals,%20Systems%20and%20Computers&rft.au=Ray,%20G.A.&rft.date=1996&rft.spage=853&rft.epage=857%20vol.2&rft.pages=853-857%20vol.2&rft.issn=1058-6393&rft.eissn=2576-2303&rft.isbn=9780818676468&rft.isbn_list=0818676469&rft_id=info:doi/10.1109/ACSSC.1996.599065&rft_dat=%3Cieee_6IE%3E599065%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=599065&rfr_iscdi=true |