Further results on the asymptotic complexity of an iterative coding scheme
The purpose of this paper is to demonstrate that it is possible to communicate over a memoryless channel of capacity C at any rate R < C with a probability of error less than 2^{-E(R)\nu},E(R)>0 , per block of a length approximately proportional to \nu^{2} and with a computational decoding com...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory Jg. 12; H. 2; S. 168 - 171 |
|---|---|
| 1. Verfasser: | |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
IEEE
01.04.1966
|
| Schlagworte: | |
| ISSN: | 0018-9448, 1557-9654 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | The purpose of this paper is to demonstrate that it is possible to communicate over a memoryless channel of capacity C at any rate R < C with a probability of error less than 2^{-E(R)\nu},E(R)>0 , per block of a length approximately proportional to \nu^{2} and with a computational decoding complexity which is asymptotically proportional to \nu^{2} when \nu is large. The decoding scheme presented in this paper is based on a two-cycle iteration of a decoding procedure which has been described in an earlier paper [1 ]. |
|---|---|
| AbstractList | The purpose of this paper is to demonstrate that it is possible to communicate over a memoryless channel of capacity C at any rate R < C with a probability of error less than 2^{-E(R)\nu},E(R)>0 , per block of a length approximately proportional to \nu^{2} and with a computational decoding complexity which is asymptotically proportional to \nu^{2} when \nu is large. The decoding scheme presented in this paper is based on a two-cycle iteration of a decoding procedure which has been described in an earlier paper [1 ]. The purpose of this paper is to demonstrate that it is possible to communicate over a memoryless channel of capacityCat any rateR < Cwith a probability of error less than2{-E(R)nu},E(R) > 0, per block of a length approximately proportional tonu{2}and with a computational decoding complexity which is asymptotically proportional tonu{2}whennuis large. The decoding scheme presented in this paper is based on a two-cycle iteration of a decoding procedure which has been described in an earlier paper [1 ]. |
| Author | Ziv, J. |
| Author_xml | – sequence: 1 givenname: J. surname: Ziv fullname: Ziv, J. |
| BookMark | eNp9UD1PwzAUtFCRaAs7EosnthQ_13HiEVWUD1ViKXOUuC_UKImD7SD673GVDoiB6el0d-_duxmZdLZDQq6BLQCYuts-bxegpFwAS5d5lp-RKaRpliiZigmZMgZ5ooTIL8jM-48IRQp8Sl7Wgwt7dNShH5rgqe1oxLT0h7YPNhhNtW37Br9NOFBb07KjJqArg_nCSO1M90693mOLl-S8LhuPV6c5J2_rh-3qKdm8Pj6v7jeJ5kyFpGKMVwiY7ZaVFJnkoq64riCGB6m0yjXEyFUmhBIZU1xnDHY8F6AlQgn1ck5ux729s58D-lC0xmtsmrJDO_iC51xmecqjkI1C7az3Duuid6Yt3aEAVhxLK2JpxbG04lRatMg_Fm1C_NV2wZWm-c94MxoNIv66M7I_dQF7YQ |
| CODEN | IETTAW |
| CitedBy_id | crossref_primary_10_1109_TIT_1969_1054380 crossref_primary_10_1109_TIT_1967_1054041 crossref_primary_10_1109_TCOMM_1994_580201 crossref_primary_10_1002_sat_4600070311 |
| Cites_doi | 10.1109/TIT.1967.1054041 10.1109/TIT.1963.1057824 10.1109/TIT.1963.1057827 10.1109/TIT.1954.1057464 |
| ContentType | Journal Article |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1109/TIT.1966.1053878 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1557-9654 |
| EndPage | 171 |
| ExternalDocumentID | 10_1109_TIT_1966_1053878 1053878 |
| Genre | orig-research |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACGOD ACIWK AENEX AETEA AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD F5P HZ~ H~9 IAAWW IBMZZ ICLAB IDIHD IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNS RXW TAE TN5 VH1 VJK AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c209t-b002be1e7d3b647624fb2cb1196169c98c1654b744947092c701d2841c6e1a1f3 |
| IEDL.DBID | RIE |
| ISSN | 0018-9448 |
| IngestDate | Sun Sep 28 08:44:59 EDT 2025 Sat Nov 29 07:47:24 EST 2025 Tue Nov 18 22:35:35 EST 2025 Wed Aug 27 02:14:33 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c209t-b002be1e7d3b647624fb2cb1196169c98c1654b744947092c701d2841c6e1a1f3 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| PQID | 28267852 |
| PQPubID | 23500 |
| PageCount | 4 |
| ParticipantIDs | proquest_miscellaneous_28267852 crossref_citationtrail_10_1109_TIT_1966_1053878 crossref_primary_10_1109_TIT_1966_1053878 ieee_primary_1053878 |
| PublicationCentury | 1900 |
| PublicationDate | 19660401 |
| PublicationDateYYYYMMDD | 1966-04-01 |
| PublicationDate_xml | – month: 04 year: 1966 text: 19660401 day: 01 |
| PublicationDecade | 1960 |
| PublicationTitle | IEEE transactions on information theory |
| PublicationTitleAbbrev | TIT |
| PublicationYear | 1966 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| References | ref7 (ref8b) 1958; vi ref5 fano (ref3) 1963; it 9 elias (ref6) 1961 wozencraft (ref2) 1961 gallager (ref4) 1964 ref1 epstein (ref8a) 1958 |
| References_xml | – year: 1961 ident: ref2 publication-title: Sequential Decoding – ident: ref1 doi: 10.1109/TIT.1967.1054041 – year: 1964 ident: ref4 publication-title: Low Density Parity Check Codes – ident: ref5 doi: 10.1109/TIT.1963.1057824 – year: 1961 ident: ref6 publication-title: Lectures on Communications System Theory – year: 1958 ident: ref8a publication-title: Coding for the Binary Erasure Channel – volume: it 9 start-page: 64 year: 1963 ident: ref3 article-title: A heuristic discussion of probabilistic decoding publication-title: IEEE Trans on Information Theory doi: 10.1109/TIT.1963.1057827 – ident: ref7 doi: 10.1109/TIT.1954.1057464 – volume: vi start-page: 56 year: 1958 ident: ref8b article-title: Algebraic decoding for a binary erasure channel publication-title: IRE Nat'l Conv Rec |
| SSID | ssj0014512 |
| Score | 1.196238 |
| Snippet | The purpose of this paper is to demonstrate that it is possible to communicate over a memoryless channel of capacity C at any rate R < C with a probability of... The purpose of this paper is to demonstrate that it is possible to communicate over a memoryless channel of capacityCat any rateR < Cwith a probability of... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 168 |
| SubjectTerms | Channel capacity Complexity theory Delays Encoding Iterative decoding Iterative methods Maximum likelihood decoding Memoryless systems Probabilistic logic Symbols |
| Title | Further results on the asymptotic complexity of an iterative coding scheme |
| URI | https://ieeexplore.ieee.org/document/1053878 https://www.proquest.com/docview/28267852 |
| Volume | 12 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1557-9654 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014512 issn: 0018-9448 databaseCode: RIE dateStart: 19630101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlR3LSuRAsBjFg3vwueLbPuxFcMbuTiedPoo4qAfxMAveQnenAguayEwi-vdWJ5lhZBdhb3l0NaGq65V6AfyKI5Vi4Uj65SIfKhXiu44Xw0R6kyYmclzbdtiEfnhIn57M4wAuFrUwiNgmn-EoXLax_LzyTfhVRhxO7KnTFVjROulqtRYRAxWLrjO4IAYmn2MekuTmcnI3GdFBS0Y9_BcV1M5U-UsQt9plvPl_37UFG70Vya46sm_DAMsd2JxPaGA9w-7Aj6V2g7twP26mwd5j5GI3z_WMVSWje2ZnHy-vdUV7sTbDHN_JNGdVwWzJuq7LJBLpVVBzjLxhfMGf8Ht8M7m-HfazFIZeclOHOTvSoUCdRy5RJAFV4aR3gvAiEkN08aGsyWmljNLcSK-5yEl1CZ-gsKKI9mC1rErcByZT7q2KuE2dUzGmqTPSkqGOQsmc2_gALufozXzfaDzMu3jOWoeDm4wIkgWCZD3iDuB8AfHaNdn4Zu1uIMDSuv7x2ZyCGTFIiHrYEqtmlpFPSQo5lof_BjyC9bB9l4xzDKv1tMETWPNv9Z_Z9LQ9Y59s9M33 |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlR3LTttAcBQeEnAoBYqAFtgDl0ok7K7Xjz2iqhHQNOohlXKzdtdjqRLYKLER_D2zthMFtULqzY99WDM7L88L4CIMVIK5Je6XiayvlPfvWp73I-l0EunA8tg0zSbi8TiZTvWvHlwuc2EQsQk-w4G_bHz5Welq_6uMKJzIM07WYCNUSvI2W2vpM1ChaGuDCyJhsjoWTkmurya3kwEdtWjQrfBGCDVdVf5ixY18Ge7-35d9hA-dHsmuW8TvQQ-Lfdhd9GhgHcnuw85KwcEDuBvWM6_xMTKy6_tqzsqC0T0z85eHx6qktVgTY47PpJyzMmemYG3dZWKK9MoLOkb2MD7gJ_g9_D75dtPvuin0neS68p12pEWBcRbYSBEPVLmVzgqCi4g0Ycb5xCYbK6VVzLV0MRcZCS_hIhRG5MEhrBdlgUfAZMKdUQE3ibUqxCSxWhpS1VEomXETHsPVAryp60qN-44X92ljcnCdEkJSj5C0A9wxfF3OeGzLbLwz9sAjYGVc9_h8gcGUSMT7PUyBZT1PyaokkRzKk39PPIetm8nPUTq6Hf_4DNt-qzY05wusV7MaT2HTPVV_5rOz5ry9Akx50T4 |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Further+results+on+the+asymptotic+complexity+of+an+iterative+coding+scheme&rft.jtitle=IEEE+transactions+on+information+theory&rft.date=1966-04-01&rft.issn=0018-9448&rft.volume=12&rft.issue=2&rft.spage=168&rft.epage=171&rft_id=info:doi/10.1109%2FTIT.1966.1053878&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9448&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9448&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9448&client=summon |