Communication Over Discrete Channels Subject to State Obfuscation
We consider communication over a state-dependent discrete memoryless channel subject to a constraint that the output sequence must be nearly independent of the state sequence. We consider both cases where the transmitter knows (causally or noncausally) and where it does not know the states. When it...
Saved in:
Published in | IEEE transactions on information theory Vol. 70; no. 12; pp. 8455 - 8466 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
IEEE
01.12.2024
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | We consider communication over a state-dependent discrete memoryless channel subject to a constraint that the output sequence must be nearly independent of the state sequence. We consider both cases where the transmitter knows (causally or noncausally) and where it does not know the states. When it does not know the states, we show that capacity can increase when the encoder uses some source of randomness that is not shared with the decoder. We consider three different cases for the state sequence: where it is independent and identically distributed across channel uses, where it is quasi-static, and where it has memory but is not quasi-static. We present single-letter capacity formulas for most combinations of the above scenarios, and also provide some illustrative examples. |
---|---|
AbstractList | We consider communication over a state-dependent discrete memoryless channel subject to a constraint that the output sequence must be nearly independent of the state sequence. We consider both cases where the transmitter knows (causally or noncausally) and where it does not know the states. When it does not know the states, we show that capacity can increase when the encoder uses some source of randomness that is not shared with the decoder. We consider three different cases for the state sequence: where it is independent and identically distributed across channel uses, where it is quasi-static, and where it has memory but is not quasi-static. We present single-letter capacity formulas for most combinations of the above scenarios, and also provide some illustrative examples. |
Author | Wang, Ligong Wornell, Gregory W. |
Author_xml | – sequence: 1 givenname: Ligong orcidid: 0000-0003-2342-4343 surname: Wang fullname: Wang, Ligong email: ligwang@isi.ee.ethz.ch organization: Department of Information Technology and Electrical Engineering, ETH Zurich, Zurich, Switzerland – sequence: 2 givenname: Gregory W. orcidid: 0000-0001-9166-4758 surname: Wornell fullname: Wornell, Gregory W. email: gww@mit.edu organization: Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, USA |
BookMark | eNpNkDtvgzAUha0qlZqk3Tt04A9A_boYxoi-IkViCJ2Rsa9VogAVNpX670tEhk5XR_d8Z_g2ZNUPPRLyyGjCGM2fq32VcMplIqTgoMQNWTMAFecpyBVZU8qyOJcyuyMb709zlMD4muyKoeumvjU6tEMflT84Ri-tNyMGjIov3fd49tFxak5oQhSG6Bj0_CkbN_mFuSe3Tp89Plzvlny-vVbFR3wo3_fF7hAbzlSITSoFaAtcWZ7mKLSx3DXWKi4cA0VBoLEgmHTcKsggS5XWSknXNA4kE2JL6LJrxsH7EV39PbadHn9rRuuLgnpWUF8U1FcFM_K0IC0i_qunNJUZiD-3I1mf |
CODEN | IETTAW |
Cites_doi | 10.1002/ett.4460100604 10.1109/ICSEE.2018.8646213 10.1109/ISIT.2012.6283628 10.1147/rd.24.0289 10.1017/CBO9781139030687 10.1002/0471200611 10.1109/TIT.2008.920242 10.1109/Allerton.2011.6120267 10.1109/TIT.2007.896860 |
ContentType | Journal Article |
DBID | 97E RIA RIE AAYXX CITATION |
DOI | 10.1109/TIT.2024.3432573 |
DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005-present IEEE All-Society Periodicals Package (ASPP) 1998-Present IEEE Electronic Library (IEL) CrossRef |
DatabaseTitle | CrossRef |
DatabaseTitleList | |
Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering Computer Science |
EISSN | 1557-9654 |
EndPage | 8466 |
ExternalDocumentID | 10_1109_TIT_2024_3432573 10606485 |
Genre | orig-research |
GrantInformation_xml | – fundername: Office of Naval Research (ONR) grantid: N000014-23-1-2803 funderid: 10.13039/100000006 |
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 AAYOK AAYXX CITATION RIG |
ID | FETCH-LOGICAL-c217t-c6435ad527d269e3acd2fbdd723f157053ecd5314f2d7585867aa774fbbf54133 |
IEDL.DBID | RIE |
ISSN | 0018-9448 |
IngestDate | Tue Jul 01 02:16:24 EDT 2025 Wed Aug 27 03:05:12 EDT 2025 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 12 |
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-c217t-c6435ad527d269e3acd2fbdd723f157053ecd5314f2d7585867aa774fbbf54133 |
ORCID | 0000-0003-2342-4343 0000-0001-9166-4758 |
PageCount | 12 |
ParticipantIDs | crossref_primary_10_1109_TIT_2024_3432573 ieee_primary_10606485 |
ProviderPackageCode | CITATION AAYXX |
PublicationCentury | 2000 |
PublicationDate | 2024-12-01 |
PublicationDateYYYYMMDD | 2024-12-01 |
PublicationDate_xml | – month: 12 year: 2024 text: 2024-12-01 day: 01 |
PublicationDecade | 2020 |
PublicationTitle | IEEE transactions on information theory |
PublicationTitleAbbrev | TIT |
PublicationYear | 2024 |
Publisher | IEEE |
Publisher_xml | – name: IEEE |
References | ref8 ref7 Pinsker (ref10) 1964 ref9 ref4 Gel’fand (ref2) 1980; 9 ref3 ref6 ref11 ref5 ref1 |
References_xml | – ident: ref11 doi: 10.1002/ett.4460100604 – ident: ref8 doi: 10.1109/ICSEE.2018.8646213 – ident: ref7 doi: 10.1109/ISIT.2012.6283628 – volume-title: Information and Information Stability of Random Variables and Processes year: 1964 ident: ref10 – ident: ref1 doi: 10.1147/rd.24.0289 – ident: ref3 doi: 10.1017/CBO9781139030687 – ident: ref9 doi: 10.1002/0471200611 – ident: ref5 doi: 10.1109/TIT.2008.920242 – ident: ref6 doi: 10.1109/Allerton.2011.6120267 – volume: 9 start-page: 19 issue: 1 year: 1980 ident: ref2 article-title: Coding for channels with random parameters publication-title: Probl. Control Inf. Theory – ident: ref4 doi: 10.1109/TIT.2007.896860 |
SSID | ssj0014512 |
Score | 2.46931 |
Snippet | We consider communication over a state-dependent discrete memoryless channel subject to a constraint that the output sequence must be nearly independent of the... |
SourceID | crossref ieee |
SourceType | Index Database Publisher |
StartPage | 8455 |
SubjectTerms | Channel capacity channels with memory Codes Decoding Error probability Monte Carlo methods quasi-static Receivers state masking state-dependent channel Transmitters |
Title | Communication Over Discrete Channels Subject to State Obfuscation |
URI | https://ieeexplore.ieee.org/document/10606485 |
Volume | 70 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LSwMxEB5sT3qwWivWFzl48bDrdjfZx7GopQq2lxZ6WyaPBRFa0d2Lv97JZldaQfC2hA2ETL7MN5l8E4AblBoxRiQgKe1xRMJcFgmPvHXBw0CGSlpx8sssni7580qsGrF6rYUxxtSXz4xvP-tcvt6oyh6VEcKJbvNUdKBDkZsTa_2kDLgYudLgI0IwBR1tTjLI7hZPC4oEQ-5bFaVIoh0ftPWoSu1TJj2YtaNxV0ne_KqUvvr6Vajx38M9gsOGXbKxWw7HsGfWfei1LzewBsh9ONgqQ3gC4x2VCJvT6mYPr7SfEKFmVn6wJgfKaIuxZzas3LCaobK5LKpP12cAy8nj4n7qNU8reIpikNJTREQEahEmOowzE6HSYSG1TsKoGImEkGmUJnjyItQ2okjjBJGYYiFlIcjvRafQXW_W5gwYqiAxyGMpY8lRGMwCpRNla4ymJkUzhNt2svN3V0EjryOPIMvJMLk1TN4YZggDO41b_7kZPP-j_QL2bXd3veQSuuVHZa6IJJTyul4c34HMuYU |
linkProvider | IEEE |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3JTsMwEB1BOQAHCgVEWX3gwiEhi53lWAFVC10uqdRb5C0SQkoRJBe-nnEW1CIhcYuiOLJsP88be94MwC0XivOAcwSSVBblHDEX-8xCa51RzxGeFEacPJ0FowV9XrJlI1avtDBa6yr4TNvmsbrLVytZmqMyRDjSbRqxbdhBw8_cWq71c2lAmVsnB3cRw-h2tLeSTnyfjBP0BT1qGx0lC_0NK7RWVqWyKsMuzNr-1MEkb3ZZCFt-_UrV-O8OH8JBwy_JoF4QR7Cl8x5029oNpIFyD_bXEhEew2BDJ0LmuL7J4yvuKEipiREg5GhCCW4y5tSGFCtScVQyF1n5Wbc5gcXwKXkYWU1xBUuiF1JYEqkI44p5ofKCWPtcKi8TSoWen7ksRGxqqRCgNPOU8SmiIOQcuWImRMbQ8vmn0MlXuT4DwqUTak4DIQJBOdM8dqQKpckyGumI6z7ctYOdvtc5NNLK93DiFCcmNROTNhPThxMzjGvf1SN4_sf7G9gdJdNJOhnPXi5gz_yqDja5hE7xUeorpAyFuK4WyjdgebzO |
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=Communication+Over+Discrete+Channels+Subject+to+State+Obfuscation&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Wang%2C+Ligong&rft.au=Wornell%2C+Gregory+W.&rft.date=2024-12-01&rft.issn=0018-9448&rft.eissn=1557-9654&rft.volume=70&rft.issue=12&rft.spage=8455&rft.epage=8466&rft_id=info:doi/10.1109%2FTIT.2024.3432573&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TIT_2024_3432573 |
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 |