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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory Vol. 12; no. 2; pp. 168 - 171
Main Author: Ziv, J.
Format: Journal Article
Language:English
Published: IEEE 01.04.1966
Subjects:
Channel capacity
Complexity theory
Delays
Encoding
Iterative decoding
Iterative methods
Maximum likelihood decoding
Memoryless systems
Probabilistic logic
Symbols
ISSN:0018-9448, 1557-9654
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
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/eLvHCXMwlR3LSsQwcFDxoAff4tscvAh2bdKkaY4iLupBPKzgrSRpAoK2stuK_r2TtrsoiuCtj0woM5lX5wVw4lPBuLRZpLPER9x6Fmkf60jYVBjvDRW6GzYh7-6yx0d1Pwdns1oY51ybfOYG4bKN5ReVbcKvMuRwZE-ZzcO8lGlXqzWLGHBBu87gFBkYfY5pSDJW56Ob0QAPWjro4b-poHamyg9B3GqX4er_vmsNVnorklx0ZF-HOVduwOp0QgPpGXYDlr-0G9yE22EzDvYeQRe7ea4npCoJ3hM9-Xh5rSvci7QZ5u4dTXNSeaJL0nVdRpGIr4KaI-gNuxe3BQ_Dq9HlddTPUogsi1Ud5uww46iTRWJSjhKQe8OsoYgXmiqrMhvKmozkXHEZK2ZlTAtUXdSmjmrqk21YKKvS7QBhXhSOc21DoxgrmKbCZF7FiS2yxCTxLpxP0ZvbvtF4mHfxnLcOR6xyJEgeCJL3iNuF0xnEa9dk44-1m4EAX9b1j4-nFMyRQULUQ5euaiY5-pSokAXb-x1wH5bC9l0yzgEs1OPGHcKifaufJuOj9ox9AvM9zwc
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlR3JTtww9AloJeAAlEVsLT70UokMtmMn8REhRlBgxGEqcYtsx5aQIEEzCYK_5znJjKhaIXHL4iV6z2_L2wB--kRykdos0lnsI2E9j7SnOpI2kcZ7w6Tumk2ko1F2d6duF-B4ngvjnGuDz9wgXLa-_KKyTfhVhhSO5Jlmi_BFCsFpl6019xkIybra4AxJGK2OmVOSqpPx5XiARy0Z9Cv8JYTarir_sOJWvgzXP_dlG7DW65HktEP8N1hw5Sasz3o0kJ5kN2H1XcHBLfg9bCZB4yNoZDcP9ZRUJcF7oqevj091hWuRNsbcvaByTipPdEm6usvIFPFVEHQE7WH36Lbhz_B8fHYR9d0UIsupqkOnHW4cc2kRm0QgDxTecGsYwoUlyqrMhsQmkwqhREoVtyllBQovZhPHNPPxDiyVVel2gXAvCyeEtqFUjJVcM2kyr2hsiyw2Md2Dkxl4c9uXGg8dLx7y1uSgKkeE5AEheQ-4Pfg1n_HUldn4YOxWQMC7cf3joxkGcySR4PfQpauaaY5WJYpkyff_P_EIli_GN9f59eXo6gBWwlZdaM4hLNWTxn2Hr_a5vp9OfrTn7Q3hOtJO
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.au=Ziv%2C+J.&rft.date=1966-04-01&rft.pub=IEEE&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.externalDocID=1053878
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