Channel Detection in Coded Communication

The problem of block-coded communication where in each block the channel law belongs to one of two disjoint sets is considered. The decoder is aimed to decode only messages that have undergone a channel from one of the sets, and thus has to detect the set which contains the underlying channel. The s...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory Jg. 63; H. 10; S. 6364 - 6392
Hauptverfasser: Weinberger, Nir, Merhav, Neri
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.10.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Channels
Coding
Decoding
Detection complexity
Detectors
Encoding
Error analysis
Error detection
error exponents
Error probability
Exponents
expurgated bounds
false alarm
False alarms
joint detection/decoding
Maximum likelihood decoding
misdetection
mismatch detection
Optimization
random coding
Receivers
Transmitters
universal detection
ISSN:0018-9448, 1557-9654
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract The problem of block-coded communication where in each block the channel law belongs to one of two disjoint sets is considered. The decoder is aimed to decode only messages that have undergone a channel from one of the sets, and thus has to detect the set which contains the underlying channel. The simplified case where each of the sets is a singleton is studied first. The decoding error, false alarm, and misdetection probabilities of a given code are defined, and the optimum detection/decoding rule in a generalized Neyman-Pearson sense is derived. Sub-optimal detection/decoding rules are also introduced which are simpler to implement. Then, various achievable bounds on the error exponents are derived, including the exact single-letter characterization of the random coding exponents for the optimal detector/decoder. The random coding analysis is then extended to general sets of channels, and an asymptotically optimal detector/decoder under a worst case formulation of the error probabilities is derived, as well as its random coding exponents. The case of a pair of binary symmetric channels is discussed in detail.
AbstractList The problem of block-coded communication where in each block the channel law belongs to one of two disjoint sets is considered. The decoder is aimed to decode only messages that have undergone a channel from one of the sets, and thus has to detect the set which contains the underlying channel. The simplified case where each of the sets is a singleton is studied first. The decoding error, false alarm, and misdetection probabilities of a given code are defined, and the optimum detection/decoding rule in a generalized Neyman-Pearson sense is derived. Sub-optimal detection/decoding rules are also introduced which are simpler to implement. Then, various achievable bounds on the error exponents are derived, including the exact single-letter characterization of the random coding exponents for the optimal detector/decoder. The random coding analysis is then extended to general sets of channels, and an asymptotically optimal detector/decoder under a worst case formulation of the error probabilities is derived, as well as its random coding exponents. The case of a pair of binary symmetric channels is discussed in detail.
Author Merhav, Neri
Weinberger, Nir
Author_xml – sequence: 1
  givenname: Nir
  surname: Weinberger
  fullname: Weinberger, Nir
  email: nir.wein@gmail.com
  organization: Technion - Israel Inst. of Technol., Haifa, Israel
– sequence: 2
  givenname: Neri
  surname: Merhav
  fullname: Merhav, Neri
  email: merhav@ee.technion.ac.il
  organization: Technion - Israel Inst. of Technol., Haifa, Israel
BookMark eNp9UD1PAzEMjVCRaAs7EkslFpYrzvdlRMdXpUosxxzlElekanPl7jrw70lpxcDAYsv2e372m5BRahMSck1hTimY-3pRzxlQPWeaMy7VGRlTKXVhlBQjMgagZWGEKC_IpO_XuRSSsjG5qz5cSriZPeKAfohtmsU0q9qAIcftdp-id4f2JTlfuU2PV6c8Je_PT3X1WizfXhbVw7LwnPOhCFTLEhg3XoZQghLYSLcSodGg8lUN00LnccDSMC8d8wANBWccBN0wRD4lt8e9u6793GM_2HW771KWtIxqwZlSRmcUHFG-a_u-w5XddXHrui9LwR78sNkPe_DDnvzIFPWH4uPw89rQubj5j3hzJEZE_NXRxgilFf8GUhJszQ
CODEN IETTAW
CitedBy_id crossref_primary_10_3390_e26121089
crossref_primary_10_1109_TIT_2020_2995136
crossref_primary_10_1109_TWC_2019_2906185
crossref_primary_10_1109_TIT_2019_2910065
crossref_primary_10_1109_TIT_2018_2882488
Cites_doi 10.1109/TIT.2011.2165826
10.1109/TIT.2016.2598350
10.1109/TIT.2014.2352300
10.1109/TIT.1968.1054129
10.1109/TIT.1982.1056514
10.1017/CBO9780511921889
10.1109/18.705540
10.1109/TIT.2017.2689778
10.1016/S0019-9958(67)91200-4
10.1109/TIT.2015.2405537
10.1017/CBO9780511804441
10.1109/TIT.2014.2335733
10.1109/TIT.2012.2184260
10.1109/TIT.2009.2027484
10.1109/TIT.2007.894695
10.1109/TIT.1973.1055037
10.2140/pjm.1958.8.171
10.1109/TIT.2014.2378259
10.1109/TIT.1974.1055254
10.1109/TIT.1970.1054406
10.1214/aoms/1177693055
10.1109/18.370109
10.1109/18.568695
10.1109/TIT.1985.1057068
10.1109/TIT.2014.2351393
10.1109/TIT.2014.2348554
10.1561/0100000052
10.1109/18.243443
10.1109/ISIT.2008.4595180
10.1109/ISIT.2011.6034125
10.1017/CBO9780511807213
10.1109/TIT.2002.1003837
10.1007/978-1-4757-2341-0
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
DOI 10.1109/TIT.2017.2732356
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEL
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 6392
ExternalDocumentID 10_1109_TIT_2017_2732356
7994676
Genre orig-research
GrantInformation_xml – fundername: Israel Science Foundation
  grantid: 412/12
  funderid: 10.13039/501100003977
– fundername: Jacobs scholarship for outstanding Ph.D. students
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-c333t-d17580239c5dd8064eb5af4db706356b2747023de892c5a2c00b10a9a0d7b2ee3
IEDL.DBID RIE
ISICitedReferencesCount 9
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000411021000020&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 Sun Oct 05 00:19:20 EDT 2025
Sat Nov 29 03:31:38 EST 2025
Tue Nov 18 21:35:28 EST 2025
Tue Aug 26 16:43:24 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 10
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/OAPA.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c333t-d17580239c5dd8064eb5af4db706356b2747023de892c5a2c00b10a9a0d7b2ee3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0001-6028-8892
0000-0002-9547-3243
OpenAccessLink http://hdl.handle.net/20.500.11850/155610
PQID 2174326697
PQPubID 36024
PageCount 29
ParticipantIDs crossref_primary_10_1109_TIT_2017_2732356
proquest_journals_2174326697
ieee_primary_7994676
crossref_citationtrail_10_1109_TIT_2017_2732356
PublicationCentury 2000
PublicationDate 2017-10-01
PublicationDateYYYYMMDD 2017-10-01
PublicationDate_xml – month: 10
  year: 2017
  text: 2017-10-01
  day: 01
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on information theory
PublicationTitleAbbrev TIT
PublicationYear 2017
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 ref35
ref13
ref34
ref37
goppa (ref15) 1975; 4
ref36
ref31
ref30
ref33
ref11
ref32
ref10
ref1
ref17
rudin (ref29) 1964
ref16
ref19
cover (ref7) 2006
ref18
csiszár (ref9) 1977
van trees (ref38) 2013
ref24
barry (ref2) 2003
ref23
ref26
ref25
ref20
ref42
wang (ref39) 2010
ref41
ref22
ref21
ref43
ref28
ref27
gallager (ref14) 1968
ref8
ref4
ref3
ref6
chandar (ref5) 0
ref40
ferguson (ref12) 1967; 1
References_xml – start-page: 107
  year: 1977
  ident: ref9
  article-title: A new look at the error exponent of discrete memoryless channels
  publication-title: Proc Int Symp Inf Theory
– ident: ref34
  doi: 10.1109/TIT.2011.2165826
– year: 0
  ident: ref5
  article-title: Sampling constrained asynchronous communication: How to sleep efficiently
  publication-title: IEEE Trans Inf Theory
– ident: ref16
  doi: 10.1109/TIT.2016.2598350
– ident: ref20
  doi: 10.1109/TIT.2014.2352300
– ident: ref13
  doi: 10.1109/TIT.1968.1054129
– year: 1964
  ident: ref29
  publication-title: Principles of Mathematical Analysis
– year: 1968
  ident: ref14
  publication-title: Information Theory and Reliable Communication
– ident: ref1
  doi: 10.1109/TIT.1982.1056514
– ident: ref8
  doi: 10.1017/CBO9780511921889
– ident: ref10
  doi: 10.1109/18.705540
– ident: ref42
  doi: 10.1109/TIT.2017.2689778
– ident: ref31
  doi: 10.1016/S0019-9958(67)91200-4
– ident: ref41
  doi: 10.1109/TIT.2015.2405537
– ident: ref4
  doi: 10.1017/CBO9780511804441
– ident: ref40
  doi: 10.1109/TIT.2014.2335733
– year: 2006
  ident: ref7
  publication-title: Elements of Information Theory
– ident: ref26
  doi: 10.1109/TIT.2012.2184260
– ident: ref36
  doi: 10.1109/TIT.2009.2027484
– ident: ref24
  doi: 10.1109/TIT.2007.894695
– ident: ref33
  doi: 10.1109/TIT.1973.1055037
– ident: ref32
  doi: 10.2140/pjm.1958.8.171
– ident: ref23
  doi: 10.1109/TIT.2014.2378259
– volume: 1
  year: 1967
  ident: ref12
  publication-title: Mathematical Statistics A Decision Theoretic Approach
– ident: ref3
  doi: 10.1109/TIT.1974.1055254
– year: 2010
  ident: ref39
  article-title: Distinguishing codes from noise: Fundamental limits and applications to sparse communication
– ident: ref6
  doi: 10.1109/TIT.1970.1054406
– ident: ref17
  doi: 10.1214/aoms/1177693055
– ident: ref27
  doi: 10.1109/18.370109
– ident: ref30
  doi: 10.1109/18.568695
– ident: ref43
  doi: 10.1109/TIT.1985.1057068
– ident: ref22
  doi: 10.1109/TIT.2014.2351393
– year: 2003
  ident: ref2
  publication-title: Digital Communication
– ident: ref21
  doi: 10.1109/TIT.2014.2348554
– ident: ref19
  doi: 10.1561/0100000052
– ident: ref18
  doi: 10.1109/18.243443
– volume: 4
  start-page: 97
  year: 1975
  ident: ref15
  article-title: Nonprobabilistic mutual information without memory
  publication-title: Problems Control Inf Theory
– year: 2013
  ident: ref38
  publication-title: Detection Estimation and Modulation Theory Part I
– ident: ref35
  doi: 10.1109/ISIT.2008.4595180
– ident: ref25
  doi: 10.1109/ISIT.2011.6034125
– ident: ref37
  doi: 10.1017/CBO9780511807213
– ident: ref11
  doi: 10.1109/TIT.2002.1003837
– ident: ref28
  doi: 10.1007/978-1-4757-2341-0
SSID ssj0014512
Score 2.3284147
Snippet The problem of block-coded communication where in each block the channel law belongs to one of two disjoint sets is considered. The decoder is aimed to decode...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 6364
SubjectTerms Channels
Coding
Decoding
Detection complexity
Detectors
Encoding
Error analysis
Error detection
error exponents
Error probability
Exponents
expurgated bounds
false alarm
False alarms
joint detection/decoding
Maximum likelihood decoding
misdetection
mismatch detection
Optimization
random coding
Receivers
Transmitters
universal detection
Title Channel Detection in Coded Communication
URI https://ieeexplore.ieee.org/document/7994676
https://www.proquest.com/docview/2174326697
Volume 63
WOSCitedRecordID wos000411021000020&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/eLvHCXMwlV1LS8NAEB7a4kEPVlvFapU9eFAw7ebVzR6lWhSkeKjQW8juTqBQ0tKm_n53Nw8qiuAtkN0kfJPJzGQeH8CtlNqH1XGHI3igAxQxChwe8shRNEWRcu4laCX9xqbTaD7n7w14qHthENEWn-HAHNpcvlrJnflVNmTcEMKPmtBkbFT0atUZgyB0i8ngrlZgHXNUKUnKh7PXmanhYgNtqj3fUFXvmSDLqfLjQ2yty6T9v-c6gePSiySPhdhPoYFZB9oVQwMpFbYDR3vjBrtwZ1oJMlySJ8xtBVZGFhkZrxQq8q1R5Aw-Js-z8YtTMiU40vf93FHaCTCT3LgMlYq0l4EiTNJACUbN_DlhQk99WmHEPRkmnqRUuDThCVVMeIj-ObSyVYYXQDzlpSFTWtVRBVrAURqivodwpVQJE2kPhhV4sSzHiBs2i2VswwnKYw13bOCOS7h7cF_vWBcjNP5Y2zXw1utKZHvQr-QTlzq2jW0wpf0Lzi5_33UFh-baReldH1r5ZofXcCA_88V2c2Nfny96L8Dv
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB5qFdSD1VaxWjUHDwqm3bya7FGqpcVaPEToLWR3J1AoqbSpv9_dzYOKIngLZJcN32Qy82VeALecSx9W8g6TUVcSFNZ3TerRwBQkQZZQaseoJT3xp9NgNqNvNXioamEQUSefYVdd6li-WPKN-lXW86kaCN_fgV3PdW2SV2tVMQPXs_Le4JZUYck6yqAkob1wHKosLr8rjbXtqGHVW0ZIT1X58SnW9mXY-N-THcNR4Ucaj7ngT6CGaRMa5YwGo1DZJhxuNRxswZ0qJkhxYTxhpnOwUmOeGoOlQGF8KxU5hffhczgYmcWsBJM7jpOZQroBqpcb5Z4QgfQzkHlx4grmE9WBjinyKW8LDKjNvdjmhDCLxDQmwmc2onMG9XSZ4jkYtrATzxdS2VG4UsRB4qE8g1mci9hnSRt6JXgRLxqJq3kWi0gTCkIjCXek4I4KuNtwX-34yJto_LG2peCt1hXItqFTyicqtGwdaTolPQzqX_y-6wb2R-HrJJqMpy-XcKDOyRPxOlDPVhu8gj3-mc3Xq2v9Kn0BsSzENg
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=Channel+Detection+in+Coded+Communication&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Weinberger%2C+Nir&rft.au=Merhav%2C+Neri&rft.date=2017-10-01&rft.issn=0018-9448&rft.eissn=1557-9654&rft.volume=63&rft.issue=10&rft.spage=6364&rft.epage=6392&rft_id=info:doi/10.1109%2FTIT.2017.2732356&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TIT_2017_2732356
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