Certain generalizations of concatenated codes--Exponential error bounds and decoding complexity

Certain generalizations of concatenated codes--Exponential error bounds and decoding complexity

New coding and decoding schemes based on concatenated codes are proposed. The new coding schemes are potentially superior to Forney's original concatenation scheme in the sense that for discrete memoryless channels the former has a smaller upper bound on the probability of decoding error for th...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory 1980-09, Vol.26 (5), p.527-534
Hauptverfasser: Hirasawa, S., Kasahara, M., Sugiyama, Y., Namekawa, T.
Format: Artikel
Sprache:eng
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 534
container_issue 5
container_start_page 527
container_title IEEE transactions on information theory
container_volume 26
creator Hirasawa, S.
Kasahara, M.
Sugiyama, Y.
Namekawa, T.
description New coding and decoding schemes based on concatenated codes are proposed. The new coding schemes are potentially superior to Forney's original concatenation scheme in the sense that for discrete memoryless channels the former has a smaller upper bound on the probability of decoding error for the same order of decoding complexity.
doi_str_mv 10.1109/TIT.1980.1056243
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_1056243</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1056243</ieee_id><sourcerecordid>28241976</sourcerecordid><originalsourceid>FETCH-LOGICAL-c358t-dcde331ad378840b51b143d5ec6cb0caa81624cf3136c9f0f86ac7f3ed9b9fa3</originalsourceid><addsrcrecordid>eNpNkMFLwzAUh4MoOKd3wUtP3jqTJmnTo4ypg4GX3kOavIxIl9Skg82_3kh38PB4_Hjfe_A-hB4JXhGC25du261IK3LCvK4YvUILwnlTtjVn12iBMRFly5i4RXcpfeXIOKkWSK4hTsr5Yg8eohrcj5pc8KkIttDBazWBz2VyMJDKcnMagwc_OTUUEGOIRR-O3qRCeVMYyJTz-wwfxgFObjrfoxurhgQPl75E3dumW3-Uu8_37fp1V2rKxVQabYBSogxthGC456QnjBoOutY91koJkp_SlhJa69ZiK2qlG0vBtH1rFV2i5_nsGMP3EdIkDy5pGAblIRyTrETFSNvUGcQzqGNIKYKVY3QHFc-SYPknUmaR8k-kvIjMK0_zigOAf_g8_QWdx3HI</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28241976</pqid></control><display><type>article</type><title>Certain generalizations of concatenated codes--Exponential error bounds and decoding complexity</title><source>IEEE Xplore</source><creator>Hirasawa, S. ; Kasahara, M. ; Sugiyama, Y. ; Namekawa, T.</creator><creatorcontrib>Hirasawa, S. ; Kasahara, M. ; Sugiyama, Y. ; Namekawa, T.</creatorcontrib><description>New coding and decoding schemes based on concatenated codes are proposed. The new coding schemes are potentially superior to Forney's original concatenation scheme in the sense that for discrete memoryless channels the former has a smaller upper bound on the probability of decoding error for the same order of decoding complexity.</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.1980.1056243</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>IEEE</publisher><ispartof>IEEE transactions on information theory, 1980-09, Vol.26 (5), p.527-534</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c358t-dcde331ad378840b51b143d5ec6cb0caa81624cf3136c9f0f86ac7f3ed9b9fa3</citedby><cites>FETCH-LOGICAL-c358t-dcde331ad378840b51b143d5ec6cb0caa81624cf3136c9f0f86ac7f3ed9b9fa3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1056243$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1056243$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Hirasawa, S.</creatorcontrib><creatorcontrib>Kasahara, M.</creatorcontrib><creatorcontrib>Sugiyama, Y.</creatorcontrib><creatorcontrib>Namekawa, T.</creatorcontrib><title>Certain generalizations of concatenated codes--Exponential error bounds and decoding complexity</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>New coding and decoding schemes based on concatenated codes are proposed. The new coding schemes are potentially superior to Forney's original concatenation scheme in the sense that for discrete memoryless channels the former has a smaller upper bound on the probability of decoding error for the same order of decoding complexity.</description><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1980</creationdate><recordtype>article</recordtype><recordid>eNpNkMFLwzAUh4MoOKd3wUtP3jqTJmnTo4ypg4GX3kOavIxIl9Skg82_3kh38PB4_Hjfe_A-hB4JXhGC25du261IK3LCvK4YvUILwnlTtjVn12iBMRFly5i4RXcpfeXIOKkWSK4hTsr5Yg8eohrcj5pc8KkIttDBazWBz2VyMJDKcnMagwc_OTUUEGOIRR-O3qRCeVMYyJTz-wwfxgFObjrfoxurhgQPl75E3dumW3-Uu8_37fp1V2rKxVQabYBSogxthGC456QnjBoOutY91koJkp_SlhJa69ZiK2qlG0vBtH1rFV2i5_nsGMP3EdIkDy5pGAblIRyTrETFSNvUGcQzqGNIKYKVY3QHFc-SYPknUmaR8k-kvIjMK0_zigOAf_g8_QWdx3HI</recordid><startdate>19800901</startdate><enddate>19800901</enddate><creator>Hirasawa, S.</creator><creator>Kasahara, M.</creator><creator>Sugiyama, Y.</creator><creator>Namekawa, T.</creator><general>IEEE</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19800901</creationdate><title>Certain generalizations of concatenated codes--Exponential error bounds and decoding complexity</title><author>Hirasawa, S. ; Kasahara, M. ; Sugiyama, Y. ; Namekawa, T.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c358t-dcde331ad378840b51b143d5ec6cb0caa81624cf3136c9f0f86ac7f3ed9b9fa3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1980</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hirasawa, S.</creatorcontrib><creatorcontrib>Kasahara, M.</creatorcontrib><creatorcontrib>Sugiyama, Y.</creatorcontrib><creatorcontrib>Namekawa, T.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Hirasawa, S.</au><au>Kasahara, M.</au><au>Sugiyama, Y.</au><au>Namekawa, T.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Certain generalizations of concatenated codes--Exponential error bounds and decoding complexity</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>1980-09-01</date><risdate>1980</risdate><volume>26</volume><issue>5</issue><spage>527</spage><epage>534</epage><pages>527-534</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>New coding and decoding schemes based on concatenated codes are proposed. The new coding schemes are potentially superior to Forney's original concatenation scheme in the sense that for discrete memoryless channels the former has a smaller upper bound on the probability of decoding error for the same order of decoding complexity.</abstract><pub>IEEE</pub><doi>10.1109/TIT.1980.1056243</doi><tpages>8</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 0018-9448
ispartof IEEE transactions on information theory, 1980-09, Vol.26 (5), p.527-534
issn 0018-9448
1557-9654
language eng
recordid cdi_ieee_primary_1056243
source IEEE Xplore
title Certain generalizations of concatenated codes--Exponential error bounds and decoding complexity
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T05%3A26%3A41IST&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=Certain%20generalizations%20of%20concatenated%20codes--Exponential%20error%20bounds%20and%20decoding%20complexity&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Hirasawa,%20S.&rft.date=1980-09-01&rft.volume=26&rft.issue=5&rft.spage=527&rft.epage=534&rft.pages=527-534&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.1980.1056243&rft_dat=%3Cproquest_RIE%3E28241976%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=28241976&rft_id=info:pmid/&rft_ieee_id=1056243&rfr_iscdi=true