Multi-Bit Relaying Over a Tandem of Channels

We study error exponents for the problem of relaying a message over a tandem of two channels sharing the same transition law, in particular moving beyond the 1-bit setting studied in recent related works. Our main results show that the 1-hop and 2-hop exponents coincide in both of the following sett...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory Jg. 69; H. 6; S. 3511 - 3524
Hauptverfasser: Ling, Yan Hao, Scarlett, Jonathan
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.06.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Channels
Decoding
Encoding
Error analysis
error exponents
Exponents
low-rate communication
Memoryless systems
Messages
Monte Carlo methods
Protocols
Relay channels
Relaying
Relays
Sufficient conditions
tandem of channels
ISSN:0018-9448, 1557-9654
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract We study error exponents for the problem of relaying a message over a tandem of two channels sharing the same transition law, in particular moving beyond the 1-bit setting studied in recent related works. Our main results show that the 1-hop and 2-hop exponents coincide in both of the following settings: (i) the number of messages is fixed, and the channel law satisfies a condition called pairwise reversibility, or (ii) the channel is arbitrary, and a zero-rate limit is taken from above. In addition, we provide various extensions of our results that relax the assumptions of pairwise reversibility and/or the two channels having identical transition laws, and we provide an example for which the 2-hop exponent is strictly below the 1-hop exponent.
AbstractList We study error exponents for the problem of relaying a message over a tandem of two channels sharing the same transition law, in particular moving beyond the 1-bit setting studied in recent related works. Our main results show that the 1-hop and 2-hop exponents coincide in both of the following settings: (i) the number of messages is fixed, and the channel law satisfies a condition called pairwise reversibility, or (ii) the channel is arbitrary, and a zero-rate limit is taken from above. In addition, we provide various extensions of our results that relax the assumptions of pairwise reversibility and/or the two channels having identical transition laws, and we provide an example for which the 2-hop exponent is strictly below the 1-hop exponent.
Author Ling, Yan Hao
Scarlett, Jonathan
Author_xml – sequence: 1
  givenname: Yan Hao
  orcidid: 0000-0002-4821-4628
  surname: Ling
  fullname: Ling, Yan Hao
  email: lingyh@nus.edu.sg
  organization: Department of Computer Science, National University of Singapore (NUS), Queenstown, Singapore
– sequence: 2
  givenname: Jonathan
  orcidid: 0000-0003-1403-9160
  surname: Scarlett
  fullname: Scarlett, Jonathan
  email: scarlett@comp.nus.edu.sg
  organization: Department of Computer Science, Department of Mathematics, Institute of Data Science, National University of Singapore (NUS), Queenstown, Singapore
BookMark eNp9kE1LAzEQQINUsK3ePXhY8OrWfO4mRy1VC5WCrOeQZmc1ZZutSSr037ulPYgHT8PAezPwRmjgOw8IXRM8IQSr-2peTSimbMIoLyVVZ2hIhChzVQg-QEOMicwV5_ICjWJc9ysXhA7R3euuTS5_dCl7g9bsnf_Ilt8QMpNVxtewybomm34a76GNl-i8MW2Eq9Mco_enWTV9yRfL5_n0YZFbqmjKJZGGrwprKWfcCgpsZVeGMistgxLqpihrgmsuOa8BFMYCOAhqTKEUNJazMbo93t2G7msHMel1twu-f6mpJKJQmGDZU8WRsqGLMUCjrUsmuc6nYFyrCdaHMrovow9l9KlML-I_4ja4jQn7_5Sbo-IA4BeORd9VsB8RhW66
CODEN IETTAW
CitedBy_id crossref_primary_10_1109_TIT_2023_3292356
crossref_primary_10_1109_TIT_2023_3335933
crossref_primary_10_1109_TIT_2024_3407354
Cites_doi 10.1109/TIT.2020.3030842
10.1002/0471200611
10.1109/TIT.2017.2690994
10.1109/TIT.1968.1054148
10.1007/978-3-7091-2945-6
10.1109/TWC.2015.2504528
10.1109/TIT.2019.2897698
10.1109/ITW.2012.6404666
10.1017/CBO9781139030687
10.1109/TIT.2015.2400999
10.1109/ISIT.2007.4557420
10.1109/ISIT.2019.8849298
10.1017/CBO9780511921889
10.1145/195058.195462
10.1109/TIT.2021.3107733
10.1016/S0019-9958(67)91200-4
10.1016/S0019-9958(67)90052-6
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
DOI 10.1109/TIT.2023.3247829
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005-present
IEEE All-Society Periodicals Package (ASPP) 1998-Present
IEEE Xplore
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications 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
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISSN 1557-9654
EndPage 3524
ExternalDocumentID 10_1109_TIT_2023_3247829
10050185
Genre orig-research
GrantInformation_xml – fundername: Singapore National Research Foundation (NRF)
  grantid: R-252-000-A74-281
  funderid: 10.13039/501100001381
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
7SP
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c292t-818a4b6cc2434c52e3bcba23c8c3e7edf67d10d4844dee9005e4e52aa699efc43
IEDL.DBID RIE
ISICitedReferencesCount 5
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001008170200006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0018-9448
IngestDate Mon Jun 30 03:48:11 EDT 2025
Sat Nov 29 03:31:50 EST 2025
Tue Nov 18 22:35:39 EST 2025
Wed Aug 27 02:50:45 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 6
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-c292t-818a4b6cc2434c52e3bcba23c8c3e7edf67d10d4844dee9005e4e52aa699efc43
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-4821-4628
0000-0003-1403-9160
PQID 2815690108
PQPubID 36024
PageCount 14
ParticipantIDs proquest_journals_2815690108
crossref_citationtrail_10_1109_TIT_2023_3247829
crossref_primary_10_1109_TIT_2023_3247829
ieee_primary_10050185
PublicationCentury 2000
PublicationDate 2023-06-01
PublicationDateYYYYMMDD 2023-06-01
PublicationDate_xml – month: 06
  year: 2023
  text: 2023-06-01
  day: 01
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on information theory
PublicationTitleAbbrev TIT
PublicationYear 2023
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref12
ref15
ref14
ref11
ref2
ref1
ref17
ref16
ref18
ref8
ref7
ref9
Forney (ref10) 1965
ref4
ref3
ref6
ref5
References_xml – ident: ref2
  doi: 10.1109/TIT.2020.3030842
– ident: ref15
  doi: 10.1002/0471200611
– ident: ref13
  doi: 10.1109/TIT.2017.2690994
– ident: ref18
  doi: 10.1109/TIT.1968.1054148
– ident: ref4
  doi: 10.1007/978-3-7091-2945-6
– ident: ref11
  doi: 10.1109/TWC.2015.2504528
– ident: ref14
  doi: 10.1109/TIT.2019.2897698
– ident: ref8
  doi: 10.1109/ITW.2012.6404666
– volume-title: Concatenated Codes
  year: 1965
  ident: ref10
– ident: ref12
  doi: 10.1017/CBO9781139030687
– ident: ref7
  doi: 10.1109/TIT.2015.2400999
– ident: ref9
  doi: 10.1109/ISIT.2007.4557420
– ident: ref1
  doi: 10.1109/ISIT.2019.8849298
– ident: ref16
  doi: 10.1017/CBO9780511921889
– ident: ref6
  doi: 10.1145/195058.195462
– ident: ref3
  doi: 10.1109/TIT.2021.3107733
– ident: ref5
  doi: 10.1016/S0019-9958(67)91200-4
– ident: ref17
  doi: 10.1016/S0019-9958(67)90052-6
SSID ssj0014512
Score 2.4657454
Snippet We study error exponents for the problem of relaying a message over a tandem of two channels sharing the same transition law, in particular moving beyond the...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 3511
SubjectTerms Channels
Decoding
Encoding
Error analysis
error exponents
Exponents
low-rate communication
Memoryless systems
Messages
Monte Carlo methods
Protocols
Relay channels
Relaying
Relays
Sufficient conditions
tandem of channels
Title Multi-Bit Relaying Over a Tandem of Channels
URI https://ieeexplore.ieee.org/document/10050185
https://www.proquest.com/docview/2815690108
Volume 69
WOSCitedRecordID wos001008170200006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
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/eLvHCXMwlV09T8MwED3RigEGCqWIQkEeWJBImw8njkdAVLAUhiJ1ixz7IlWCFrUpvx-fk1ZFCCS2DLZlPftyZ_veO4Cr2GiZIE-9JMmNx3Ofe5Ir6fFUq5gHIih844pNiNEonUzkS01Wd1wYRHTJZ9inT_eWb-Z6RVdl1sJ90p-LG9AQIqnIWpsnAx4HlTR4YC3YHjrWb5K-HIyfxn0qE9630YP1iPKbD3JFVX78iZ17Gbb-ObFDOKjjSHZbLfwR7OCsDa11jQZWm2wb9rcEB4_hxvFtvbtpySgLjihO7NluZqbYmG6T39m8YEQ4mFmX2YHX4cP4_tGr6yV4OpRh6Vnfq3hOidA84joOMcp1rsJIpzpCgaZIhAl8w1PODaK0c0aOcahUIiUWmkcn0JzNZ3gKzEZ5qSER6yJAbiMOhYJCt0QkZNBCdWGwRjDTtZg41bR4y9yhwpeZxTwjzLMa8y5cb3p8VEIaf7TtEMZb7Sp4u9Bbr1JWm9oyC0nvhpJM0rNfup3DHo1eJXj1oFkuVngBu_qznC4Xl24XfQFx1cEQ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB58gXrwURXrMwcvgtvuY_aRo4qlolYPK_S2ZJNZELQVrf5-M9mtKKLgbQ8JCV8yO5Nkvm8AjmKjZUKYeUlSGg9LHz2JSnqYaRVjkAaVb1yxiXQwyIZDedeQ1R0Xhohc8hl1-NO95ZuxfuOrMmvhPuvPxbMwHyOGfk3X-nw0wDioxcEDa8P22DF9lfRlN7_MO1wovGPjB-sT5Tcv5Mqq_PgXOwfTW_3n1NZgpYkkxWm99OswQ6MWrE6rNIjGaFuw_EVycANOHOPWO3uYCM6DY5KTuLXbWSiR833ykxhXgikHI-s0N-G-d5Gf972mYoKnQxlOPOt9FZacCo0R6jikqNSlCiOd6YhSMlWSmsA3mCEaImnnTEhxqFQiJVUaoy2YG41HtA3CxnmZYRnrKiC0MYeilIO3JE3YpFPVhu4UwUI3cuJc1eKxcMcKXxYW84IxLxrM23D82eO5ltL4o-0mY_ylXQ1vG_amq1Q0xvZahKx4w2km2c4v3Q5hsZ_fXBfXl4OrXVjikep0rz2Ym7y80T4s6PfJw-vLgdtRH6zLxFc
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=Multi-Bit+Relaying+Over+a+Tandem+of+Channels&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Ling%2C+Yan+Hao&rft.au=Scarlett%2C+Jonathan&rft.date=2023-06-01&rft.pub=IEEE&rft.issn=0018-9448&rft.volume=69&rft.issue=6&rft.spage=3511&rft.epage=3524&rft_id=info:doi/10.1109%2FTIT.2023.3247829&rft.externalDocID=10050185
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