Multiuser Random Coding Techniques for Mismatched Decoding

This paper studies multiuser random coding techniques for channel coding with a given (possibly suboptimal) decoding rule. For the mismatched discrete memoryless multiple-access channel, an error exponent is obtained that is tight with respect to the ensemble average, and positive within the interio...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory Jg. 62; H. 7; S. 3950 - 3970
Hauptverfasser:	Scarlett, Jonathan, Martinez, Alfonso, Guillen i Fabregas, Albert
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.07.2016 The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Institute of Electrical and Electronics Engineers (IEEE)
Schlagworte:	Channels Codes Coding Coding theory Communication channels Decoding Electronic mail Encoding ensemble tightness Equivalence error exponents Exponents Indexes Information theory Lagrange duality Maximum likelihood decoding Measurement Mismatched decoding multiple-access channel random coding superposition coding Tightness maximum-likelihood decoding multiple-access channel Lagrange duality error exponents superposition coding Mismatched decoding random coding ensemble tightness
ISSN:	0018-9448, 1557-9654
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Abstract	This paper studies multiuser random coding techniques for channel coding with a given (possibly suboptimal) decoding rule. For the mismatched discrete memoryless multiple-access channel, an error exponent is obtained that is tight with respect to the ensemble average, and positive within the interior of Lapidoth's achievable rate region. This exponent proves the ensemble tightness of the exponent of Liu and Hughes in the case of maximum-likelihood decoding. An equivalent dual form of Lapidoth's achievable rate region is given, and the latter is shown to immediately extend to channels with infinite and continuous alphabets. In the setting of single-user mismatched decoding, similar analysis techniques are applied to a refined version of superposition coding, which is shown to achieve rates at least as high as standard superposition coding for any set of random-coding parameters.
AbstractList	This paper studies multiuser random coding techniques for channel coding with a given (possibly suboptimal) decoding rule. For the mismatched discrete memoryless multiple-access channel, an error exponent is obtained that is tight with respect to the ensemble average, and positive within the interior of Lapidoth's achievable rate region. This exponent proves the ensemble tightness of the exponent of Liu and Hughes in the case of maximum-likelihood decoding. An equivalent dual form of Lapidoth's achievable rate region is given, and the latter is shown to immediately extend to channels with infinite and continuous alphabets. In the setting of single-user mismatched decoding, similar analysis techniques are applied to a refined version of superposition coding, which is shown to achieve rates at least as high as standard superposition coding for any set of random-coding parameters. This paper studies multiuser random coding techniques for channel coding with a given (possibly suboptimal) decoding rule. For the mismatched discrete memoryless multiple-access channel, an error exponent is obtained that is tight with respect to the ensemble average, and positive within the interior of Lapidoth's achievable rate region. This exponent proves the ensemble tightness of the exponent of Liu and Hughes in the case of maximum-likelihood decoding. An equivalent dual form of Lapidoth's achievable rate region is given, and the latter is shown to immediately extend to channels with infinite and continuous alphabets. In the setting of single-user mismatched decoding, similar analysis techniques are applied to a refined version of superposition coding, which is shown to achieve rates at least as high as standard superposition coding for any set of random-coding parameters. This work was supported in part by the European Union Seventh Framework Program under Grant 303633, in part by the Spanish Ministry of Economy and Competitiveness under Grant RYC-2011-08150, and Grant TEC2012-38800-C03-03, and in part by the European Research Council under Grant 259663.
Author	Guillen i Fabregas, Albert Scarlett, Jonathan Martinez, Alfonso
Author_xml	– sequence: 1 givenname: Jonathan surname: Scarlett fullname: Scarlett, Jonathan email: jmscarlett@gmail.com organization: Dept. of Eng., Univ. of Cambridge, Cambridge, UK – sequence: 2 givenname: Alfonso surname: Martinez fullname: Martinez, Alfonso email: alfonso.martinez@ieee.org organization: Dept. of Inf. & Commun. Technol., Univ. Pompeu Fabra, Barcelona, Spain – sequence: 3 givenname: Albert surname: Guillen i Fabregas fullname: Guillen i Fabregas, Albert email: guillen@ieee.org organization: Dept. of Eng., Univ. of Cambridge, Cambridge, UK
BookMark	eNp9kctLxDAQh4MouD7ugpeCFy9dJ6-m8SbrExRB1nPIplONdBtN2oP_vVl3UfDgIYSB70tm5rdHtvvQIyFHFKaUgj6b382nDGg1ZVJKTtUWmVApVakrKbbJBIDWpRai3iV7Kb3lUkjKJuT8YewGPyaMxZPtm7AsZqHx_UsxR_fa-48RU9GGWDz4tLSDe8WmuET3jRyQndZ2CQ839z55vr6az27L-8ebu9nFfekE1EPJec10qxE0b5u2wgaktY430C7AMawYalo7AG2rRnNc6IUSlFHJtKsatMj3CV2_69LoTESH0dnBBOt_i9VhoJjhXMlaZed07bzHsJphMEufHHad7TGMydA6r4lWQsmMnvxB38IY-zxRpoCx3AqHTMGmiRhSitia9-iXNn4aCmYVgMkBmFUAZhNAVqo_ivODHXzoh2h99594vBY9Iv78o4QUign-BXWXkyQ
CODEN	IETTAW
CitedBy_id	crossref_primary_10_1109_TIT_2021_3058070 crossref_primary_10_1109_TIT_2024_3356477 crossref_primary_10_1109_TIT_2023_3257189 crossref_primary_10_1109_TIT_2022_3146308 crossref_primary_10_1109_TIT_2023_3259029 crossref_primary_10_1109_TIT_2017_2781363 crossref_primary_10_1109_TIT_2022_3231192
Cites_doi	10.1017/CBO9780511921889 10.1109/18.887846 10.1017/CBO9780511804441 10.1109/18.532884 10.1016/S0012-365X(96)00107-0 10.1109/TIT.1981.1056281 10.1007/BFb0034351 10.1109/18.340469 10.1109/18.481778 10.1109/TIT.2002.805064 10.1109/TIT.1977.1055655 10.1109/TIT.2014.2322033 10.1109/TIT.1956.1056798 10.1109/TIT.2015.2468719 10.1002/j.1538-7305.1948.tb01338.x 10.1109/18.370120 10.1109/18.485710 10.1109/TIT.2014.2331952 10.1109/TIT.1985.1057022 10.1109/TIT.1979.1056064 10.1109/18.476314 10.1109/TIT.2015.2400999 10.1109/TIT.1980.1056275 10.1109/ITA.2013.6502939 10.1109/TIT.2014.2385699 10.1017/CBO9781139030687 10.1109/CACSD.2004.1393890 10.1109/TIT.2014.2310453 10.1073/pnas.39.1.42 10.1109/Allerton.2012.6483461
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jul 2016 info:eu-repo/semantics/openAccess © 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The final published article can be found at http://dx.doi.org/10.1109/TIT.2016.2555317
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jul 2016 – notice: info:eu-repo/semantics/openAccess © 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The final published article can be found at <a href="http://dx.doi.org/10.1109/TIT.2016.2555317">http://dx.doi.org/10.1109/TIT.2016.2555317</a>
DBID	97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 XX2
DOI	10.1109/TIT.2016.2555317
DatabaseName	IEEE Xplore (IEEE) 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 ANTE: Abstracts in New Technology & Engineering Engineering Research Database Recercat
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 Engineering Research Database ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList	Technology Research Database Technology Research Database
Database_xml	– sequence: 1 dbid: RIE name: IEEE Xplore url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science
EISSN	1557-9654
EndPage	3970
ExternalDocumentID	oai_recercat_cat_2072_337587 4110072871 10_1109_TIT_2016_2555317 7454724
Genre	orig-research Feature
GrantInformation_xml	– fundername: European Research Council grantid: 259663 funderid: 10.13039/501100000781 – fundername: European Union Seventh Framework Program grantid: 303633 – fundername: Spanish Ministry of Economy and Competitiveness grantid: RYC-2011-08150; TEC2012-38800-C03-03
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 F28 FR3 XX2
ID	FETCH-LOGICAL-c408t-33829f9e093fdf6ed05aac3d0fb0c2e62e918c009a6d93eb9b74121529c6deae3
IEDL.DBID	RIE
ISICitedReferencesCount	16
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000382135600010&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	Fri Nov 07 13:35:11 EST 2025 Sat Sep 27 21:23:21 EDT 2025 Sun Nov 09 08:32:23 EST 2025 Tue Nov 18 21:35:28 EST 2025 Sat Nov 29 03:31:36 EST 2025 Tue Aug 26 16:40:40 EDT 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	7
Keywords	maximum-likelihood decoding multiple-access channel Lagrange duality error exponents superposition coding Mismatched decoding random coding ensemble tightness
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c408t-33829f9e093fdf6ed05aac3d0fb0c2e62e918c009a6d93eb9b74121529c6deae3
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23
ORCID	0000-0003-1403-9160
OpenAccessLink	https://recercat.cat/handle/2072/337587
PQID	1802221530
PQPubID	36024
PageCount	21
ParticipantIDs	proquest_miscellaneous_1825516475 ieee_primary_7454724 csuc_recercat_oai_recercat_cat_2072_337587 proquest_journals_1802221530 crossref_primary_10_1109_TIT_2016_2555317 crossref_citationtrail_10_1109_TIT_2016_2555317
PublicationCentury	2000
PublicationDate	2016-07-01
PublicationDateYYYYMMDD	2016-07-01
PublicationDate_xml	– month: 07 year: 2016 text: 2016-07-01 day: 01
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE transactions on information theory
PublicationTitleAbbrev	TIT
PublicationYear	2016
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Institute of Electrical and Electronics Engineers (IEEE)
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) – name: Institute of Electrical and Electronics Engineers (IEEE)
References	ref35 hui (ref1) 1983 ref34 ref12 ref37 ref36 ref14 ref30 ref33 ref11 ref32 ref2 ref39 ref17 ref38 ref19 shulman (ref28) 2003 gallager (ref25) 1974; 10 pinsker (ref31) 1970; 6 cover (ref40) 2006 scarlett (ref13) 2014 ref24 ref23 ref26 gallager (ref15) 2016 ref20 ref41 ref22 kaplan (ref10) 1993; 47 ref27 ganti (ref7) 2000; 46 csiszar (ref3) 1995; 41 ref29 ref8 ref9 d’yachkov (ref18) 1980; 16 ref4 ref6 ref5 elias (ref16) 1955 gallager (ref21) 1968
References_xml	– ident: ref14 doi: 10.1017/CBO9780511921889 – volume: 46 start-page: 2315 year: 2000 ident: ref7 article-title: Mismatched decoding revisited: General alphabets, channels with memory, and the wide-band limit publication-title: IEEE Trans Inf Theory doi: 10.1109/18.887846 – ident: ref39 doi: 10.1017/CBO9780511804441 – ident: ref6 doi: 10.1109/18.532884 – ident: ref37 doi: 10.1016/S0012-365X(96)00107-0 – ident: ref2 doi: 10.1109/TIT.1981.1056281 – ident: ref35 doi: 10.1007/BFb0034351 – ident: ref4 doi: 10.1109/18.340469 – ident: ref33 doi: 10.1109/18.481778 – ident: ref11 doi: 10.1109/TIT.2002.805064 – year: 2014 ident: ref13 article-title: Reliable communication under mismatched decoding – ident: ref26 doi: 10.1109/TIT.1977.1055655 – ident: ref22 doi: 10.1109/TIT.2014.2322033 – year: 2006 ident: ref40 publication-title: Elements of Information Theory – ident: ref32 doi: 10.1109/TIT.1956.1056798 – ident: ref34 doi: 10.1109/TIT.2015.2468719 – year: 1983 ident: ref1 article-title: Fundamental issues of multiple accessing – ident: ref30 doi: 10.1002/j.1538-7305.1948.tb01338.x – volume: 41 start-page: 35 year: 1995 ident: ref3 article-title: channel capacity for a given decoding metric publication-title: IEEE Transactions on Information Theory doi: 10.1109/18.370120 – volume: 10 start-page: 3 year: 1974 ident: ref25 article-title: Capacity and coding for degraded broadcast channels publication-title: Problemy Peredachi Inf – ident: ref12 doi: 10.1109/18.485710 – year: 2003 ident: ref28 article-title: Communication over an unknown channel via common broadcasting – volume: 6 start-page: 20 year: 1970 ident: ref31 article-title: Zero error capacity with erasure publication-title: Problems Inf Transmiss – ident: ref17 doi: 10.1109/TIT.2014.2331952 – volume: 47 start-page: 228 year: 1993 ident: ref10 article-title: Information rates and error exponents of compound channels with application to antipodal signaling in a fading environment publication-title: AEU – ident: ref20 doi: 10.1109/TIT.1985.1057022 – ident: ref24 doi: 10.1109/TIT.1979.1056064 – ident: ref5 doi: 10.1109/18.476314 – ident: ref36 doi: 10.1109/TIT.2015.2400999 – ident: ref27 doi: 10.1109/TIT.1980.1056275 – ident: ref23 doi: 10.1109/ITA.2013.6502939 – ident: ref9 doi: 10.1109/TIT.2014.2385699 – ident: ref19 doi: 10.1017/CBO9781139030687 – ident: ref29 doi: 10.1109/CACSD.2004.1393890 – year: 1968 ident: ref21 publication-title: Information Theory and Reliable Communication – year: 2016 ident: ref15 publication-title: Fixed Composition Arguments and Lower Bounds to Error Probability – ident: ref8 doi: 10.1109/TIT.2014.2310453 – ident: ref41 doi: 10.1073/pnas.39.1.42 – ident: ref38 doi: 10.1109/Allerton.2012.6483461 – start-page: 61 year: 1955 ident: ref16 article-title: Coding for two noisy channels publication-title: Proc 3rd London Symp Inf Theory – volume: 16 start-page: 3 year: 1980 ident: ref18 article-title: Bounds on the average error probability for a code ensemble with fixed composition publication-title: Problemy Peredachi Inf
SSID	ssj0014512
Score	2.341487
Snippet	This paper studies multiuser random coding techniques for channel coding with a given (possibly suboptimal) decoding rule. For the mismatched discrete...
SourceID	csuc proquest crossref ieee
SourceType	Open Access Repository Aggregation Database Enrichment Source Index Database Publisher
StartPage	3950
SubjectTerms	Channels Codes Coding Coding theory Communication channels Decoding Electronic mail Encoding ensemble tightness Equivalence error exponents Exponents Indexes Information theory Lagrange duality Maximum likelihood decoding Measurement Mismatched decoding multiple-access channel random coding superposition coding Tightness
Title	Multiuser Random Coding Techniques for Mismatched Decoding
URI	https://ieeexplore.ieee.org/document/7454724 https://www.proquest.com/docview/1802221530 https://www.proquest.com/docview/1825516475 https://recercat.cat/handle/2072/337587
Volume	62
WOSCitedRecordID	wos000382135600010&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 Xplore 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/eLvHCXMwlV3fa9RAEB7awwd9sNoqXq2ygi-K6e1tNtmsb9JaWtAickrfls3uBAo1kctd_35n8gtFKfgQkpDJkuTbyczs7H4D8Jo81qiisQmSP5DoXNqEurJKfFHpIhiPWUe7-P2Tubwsrq7slx14N62FQcRu8hke82GXy49N2PJQ2cIw-5TSu7BrTN6v1ZoyBjpb9szgS1JgijnGlKS0i9XFiudw5cfkPlOXM3-YoFlot2EorfLX_7gzMmd7__d4j-Dh4EyKDz36j2EH633YGws1iEFv9-HBb6yDB_C-W3TLoxPiq69j80OcNGzBxGrkc20FubLi83VL7iyBGsUpBaks8gS-nX1cnZwnQwmFJGhZbBIKQJWtLEqbVrHKMcrM-5BGWZUyKMwV2mURyM_yebQplrYkD4NL3dqQR_SYPoVZ3dT4DEQRSouVzGJZeZ0FTbugNdP5oc1ils5hMX5VFwZ-cS5zceO6OENaRzg4xsENOMzhzXTHz55b4w7ZtwyUIzOA6-A3jmmxpxPelDTKpSnFPyR8wOhMjQ7AzOFohNcNmto6ZsBT9MapnMOr6TLpGCdOfI3NlmUU5xO1yQ7_3fJzuM8P20_jPYLZZr3FF3Av3G6u2_XLrqP-AkqL5GA
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3di9QwEB_OVVAfPL1TXD01gi-Kvc2m6Ud8k9PjDvcWkSr3FtJkCgfaynbXv9-ZfqEogg-lLZ2Gtr9MZyaT_AbgBXmsQYXMREj-QKRTaSLqyipyeaVznzlMOtrFL6tsvc4vL83HPXg9rYVBxG7yGR7zYZfLD43f8VDZImP2KaWvwfVEayX71VpTzkAny54bfEkqTFHHmJSUZlGcFzyLKz0mB5o6XfabEZr5dueH4ip__JE7M3O6_38PeBfuDO6keNvjfw_2sD6A_bFUgxg09wBu_8I7eAhvumW3PD4hPrk6NN_EScM2TBQjo2sryJkVF1ctObQEaxDvKExlkfvw-fR9cXIWDUUUIq9lvo0oBFWmMihNXIUqxSAT53wcZFVKrzBVaJa5J0_LpcHEWJqSfAwudmt8GtBh_ABmdVPjQxC5Lw1WMgll5XTiNe084aBljCYJSTyHxfhVrR8YxrnQxVfbRRrSWMLBMg52wGEOL6c7vvfsGv-QfcVAWTIEuPFua5kYezrhTclM2TimCIiEDxmdqdEBmDkcjfDaQVdbyxx4it44lnN4Pl0mLePUiaux2bGM4oyizpJHf2_5Gdw8Ky5WdnW-_vAYbvGD95N6j2C23ezwCdzwP7ZX7eZp12l_Ak_w56c
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=Multiuser+Random+Coding+Techniques+for+Mismatched+Decoding&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Scarlett%2C+Jonathan&rft.au=Martinez%2C+Alfonso&rft.au=i+F%C3%A0bregas%2C+Albert+Guill%C3%A9n&rft.date=2016-07-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=0018-9448&rft.eissn=1557-9654&rft.volume=62&rft.issue=7&rft.spage=3950&rft_id=info:doi/10.1109%2FTIT.2016.2555317&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=4110072871
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