An Achievable Rate Region for the Three-User Interference Channel Based on Coset Codes
We consider the problem of communication over a three-user discrete memoryless interference channel (3-IC). The current known coding techniques for communicating over an arbitrary 3-IC are based on message splitting, superposition coding, and binning using independent and identically distributed (i....
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
A Padakandla [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2016 |
|---|
| Schlagwörter: |
|---|
| Systematik: |
|
|---|
| Übergeordnetes Werk: |
Enthalten in: IEEE transactions on information theory - Piscataway, NJ : IEEE, 1963, 62(2016), 3, Seite 1250 |
|---|---|
| Übergeordnetes Werk: |
volume:62 ; year:2016 ; number:3 ; pages:1250 |
| Katalog-ID: |
OLC1972621718 |
|---|
| LEADER | 01000caa a2200265 4500 | ||
|---|---|---|---|
| 001 | OLC1972621718 | ||
| 003 | DE-627 | ||
| 005 | 20220221163259.0 | ||
| 007 | tu | ||
| 008 | 160427s2016 xx ||||| 00| ||eng c | ||
| 028 | 5 | 2 | |a PQ20160430 |
| 035 | |a (DE-627)OLC1972621718 | ||
| 035 | |a (DE-599)GBVOLC1972621718 | ||
| 035 | |a (PRQ)p653-168cf6f60734054b1de8dbdeaf6e2a0e2c0b266225da839fa72e39e968699d910 | ||
| 035 | |a (KEY)0023448620160000062000301250achievablerateregionforthethreeuserinterferencecha | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 070 |a 620 |q DNB |
| 084 | |a SA 5570 |q AVZ |2 rvk | ||
| 100 | 0 | |a A Padakandla |e verfasserin |4 aut | |
| 245 | 1 | 3 | |a An Achievable Rate Region for the Three-User Interference Channel Based on Coset Codes |
| 264 | 1 | |c 2016 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 520 | |a We consider the problem of communication over a three-user discrete memoryless interference channel (3-IC). The current known coding techniques for communicating over an arbitrary 3-IC are based on message splitting, superposition coding, and binning using independent and identically distributed (i.i.d.) random codebooks. In this paper, we propose a new ensemble of codes -- partitioned coset codes (PCCs) -- that possess an appropriate mix of empirical and algebraic closure properties. We develop coding techniques that exploit the algebraic closure property of PCC to enable interference alignment over general 3-IC. We analyze the performance of the proposed coding technique to derive an achievable rate region for the general discrete 3-IC. Additive and non-additive examples are identified for which the derived achievable rate region is the capacity, moreover, strictly larger than the current known largest achievable rate regions based on the i.i.d. random codebooks. | ||
| 650 | 4 | |a Communication | |
| 650 | 4 | |a Codes | |
| 650 | 4 | |a Algebra | |
| 650 | 4 | |a Information theory | |
| 700 | 0 | |a AG Sahebi |4 oth | |
| 700 | 0 | |a SS Pradhan |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |t IEEE transactions on information theory |d Piscataway, NJ : IEEE, 1963 |g 62(2016), 3, Seite 1250 |w (DE-627)12954731X |w (DE-600)218505-2 |w (DE-576)01499819X |x 0018-9448 |7 nnns |
| 773 | 1 | 8 | |g volume:62 |g year:2016 |g number:3 |g pages:1250 |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-TEC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OLC-BUB | ||
| 912 | |a SSG-OPC-BBI | ||
| 912 | |a GBV_ILN_65 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_2002 | ||
| 912 | |a GBV_ILN_2088 | ||
| 936 | r | v | |a SA 5570 |
| 951 | |a AR | ||
| 952 | |d 62 |j 2016 |e 3 |h 1250 | ||
| author_variant |
a p ap |
|---|---|
| matchkey_str |
article:00189448:2016----::ncivbeaeeinoteheueitreeccan |
| hierarchy_sort_str |
2016 |
| publishDate |
2016 |
| allfields |
PQ20160430 (DE-627)OLC1972621718 (DE-599)GBVOLC1972621718 (PRQ)p653-168cf6f60734054b1de8dbdeaf6e2a0e2c0b266225da839fa72e39e968699d910 (KEY)0023448620160000062000301250achievablerateregionforthethreeuserinterferencecha DE-627 ger DE-627 rakwb eng 070 620 DNB SA 5570 AVZ rvk A Padakandla verfasserin aut An Achievable Rate Region for the Three-User Interference Channel Based on Coset Codes 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier We consider the problem of communication over a three-user discrete memoryless interference channel (3-IC). The current known coding techniques for communicating over an arbitrary 3-IC are based on message splitting, superposition coding, and binning using independent and identically distributed (i.i.d.) random codebooks. In this paper, we propose a new ensemble of codes -- partitioned coset codes (PCCs) -- that possess an appropriate mix of empirical and algebraic closure properties. We develop coding techniques that exploit the algebraic closure property of PCC to enable interference alignment over general 3-IC. We analyze the performance of the proposed coding technique to derive an achievable rate region for the general discrete 3-IC. Additive and non-additive examples are identified for which the derived achievable rate region is the capacity, moreover, strictly larger than the current known largest achievable rate regions based on the i.i.d. random codebooks. Communication Codes Algebra Information theory AG Sahebi oth SS Pradhan oth Enthalten in IEEE transactions on information theory Piscataway, NJ : IEEE, 1963 62(2016), 3, Seite 1250 (DE-627)12954731X (DE-600)218505-2 (DE-576)01499819X 0018-9448 nnns volume:62 year:2016 number:3 pages:1250 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI GBV_ILN_65 GBV_ILN_70 GBV_ILN_2002 GBV_ILN_2088 SA 5570 AR 62 2016 3 1250 |
| spelling |
PQ20160430 (DE-627)OLC1972621718 (DE-599)GBVOLC1972621718 (PRQ)p653-168cf6f60734054b1de8dbdeaf6e2a0e2c0b266225da839fa72e39e968699d910 (KEY)0023448620160000062000301250achievablerateregionforthethreeuserinterferencecha DE-627 ger DE-627 rakwb eng 070 620 DNB SA 5570 AVZ rvk A Padakandla verfasserin aut An Achievable Rate Region for the Three-User Interference Channel Based on Coset Codes 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier We consider the problem of communication over a three-user discrete memoryless interference channel (3-IC). The current known coding techniques for communicating over an arbitrary 3-IC are based on message splitting, superposition coding, and binning using independent and identically distributed (i.i.d.) random codebooks. In this paper, we propose a new ensemble of codes -- partitioned coset codes (PCCs) -- that possess an appropriate mix of empirical and algebraic closure properties. We develop coding techniques that exploit the algebraic closure property of PCC to enable interference alignment over general 3-IC. We analyze the performance of the proposed coding technique to derive an achievable rate region for the general discrete 3-IC. Additive and non-additive examples are identified for which the derived achievable rate region is the capacity, moreover, strictly larger than the current known largest achievable rate regions based on the i.i.d. random codebooks. Communication Codes Algebra Information theory AG Sahebi oth SS Pradhan oth Enthalten in IEEE transactions on information theory Piscataway, NJ : IEEE, 1963 62(2016), 3, Seite 1250 (DE-627)12954731X (DE-600)218505-2 (DE-576)01499819X 0018-9448 nnns volume:62 year:2016 number:3 pages:1250 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI GBV_ILN_65 GBV_ILN_70 GBV_ILN_2002 GBV_ILN_2088 SA 5570 AR 62 2016 3 1250 |
| allfields_unstemmed |
PQ20160430 (DE-627)OLC1972621718 (DE-599)GBVOLC1972621718 (PRQ)p653-168cf6f60734054b1de8dbdeaf6e2a0e2c0b266225da839fa72e39e968699d910 (KEY)0023448620160000062000301250achievablerateregionforthethreeuserinterferencecha DE-627 ger DE-627 rakwb eng 070 620 DNB SA 5570 AVZ rvk A Padakandla verfasserin aut An Achievable Rate Region for the Three-User Interference Channel Based on Coset Codes 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier We consider the problem of communication over a three-user discrete memoryless interference channel (3-IC). The current known coding techniques for communicating over an arbitrary 3-IC are based on message splitting, superposition coding, and binning using independent and identically distributed (i.i.d.) random codebooks. In this paper, we propose a new ensemble of codes -- partitioned coset codes (PCCs) -- that possess an appropriate mix of empirical and algebraic closure properties. We develop coding techniques that exploit the algebraic closure property of PCC to enable interference alignment over general 3-IC. We analyze the performance of the proposed coding technique to derive an achievable rate region for the general discrete 3-IC. Additive and non-additive examples are identified for which the derived achievable rate region is the capacity, moreover, strictly larger than the current known largest achievable rate regions based on the i.i.d. random codebooks. Communication Codes Algebra Information theory AG Sahebi oth SS Pradhan oth Enthalten in IEEE transactions on information theory Piscataway, NJ : IEEE, 1963 62(2016), 3, Seite 1250 (DE-627)12954731X (DE-600)218505-2 (DE-576)01499819X 0018-9448 nnns volume:62 year:2016 number:3 pages:1250 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI GBV_ILN_65 GBV_ILN_70 GBV_ILN_2002 GBV_ILN_2088 SA 5570 AR 62 2016 3 1250 |
| allfieldsGer |
PQ20160430 (DE-627)OLC1972621718 (DE-599)GBVOLC1972621718 (PRQ)p653-168cf6f60734054b1de8dbdeaf6e2a0e2c0b266225da839fa72e39e968699d910 (KEY)0023448620160000062000301250achievablerateregionforthethreeuserinterferencecha DE-627 ger DE-627 rakwb eng 070 620 DNB SA 5570 AVZ rvk A Padakandla verfasserin aut An Achievable Rate Region for the Three-User Interference Channel Based on Coset Codes 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier We consider the problem of communication over a three-user discrete memoryless interference channel (3-IC). The current known coding techniques for communicating over an arbitrary 3-IC are based on message splitting, superposition coding, and binning using independent and identically distributed (i.i.d.) random codebooks. In this paper, we propose a new ensemble of codes -- partitioned coset codes (PCCs) -- that possess an appropriate mix of empirical and algebraic closure properties. We develop coding techniques that exploit the algebraic closure property of PCC to enable interference alignment over general 3-IC. We analyze the performance of the proposed coding technique to derive an achievable rate region for the general discrete 3-IC. Additive and non-additive examples are identified for which the derived achievable rate region is the capacity, moreover, strictly larger than the current known largest achievable rate regions based on the i.i.d. random codebooks. Communication Codes Algebra Information theory AG Sahebi oth SS Pradhan oth Enthalten in IEEE transactions on information theory Piscataway, NJ : IEEE, 1963 62(2016), 3, Seite 1250 (DE-627)12954731X (DE-600)218505-2 (DE-576)01499819X 0018-9448 nnns volume:62 year:2016 number:3 pages:1250 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI GBV_ILN_65 GBV_ILN_70 GBV_ILN_2002 GBV_ILN_2088 SA 5570 AR 62 2016 3 1250 |
| allfieldsSound |
PQ20160430 (DE-627)OLC1972621718 (DE-599)GBVOLC1972621718 (PRQ)p653-168cf6f60734054b1de8dbdeaf6e2a0e2c0b266225da839fa72e39e968699d910 (KEY)0023448620160000062000301250achievablerateregionforthethreeuserinterferencecha DE-627 ger DE-627 rakwb eng 070 620 DNB SA 5570 AVZ rvk A Padakandla verfasserin aut An Achievable Rate Region for the Three-User Interference Channel Based on Coset Codes 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier We consider the problem of communication over a three-user discrete memoryless interference channel (3-IC). The current known coding techniques for communicating over an arbitrary 3-IC are based on message splitting, superposition coding, and binning using independent and identically distributed (i.i.d.) random codebooks. In this paper, we propose a new ensemble of codes -- partitioned coset codes (PCCs) -- that possess an appropriate mix of empirical and algebraic closure properties. We develop coding techniques that exploit the algebraic closure property of PCC to enable interference alignment over general 3-IC. We analyze the performance of the proposed coding technique to derive an achievable rate region for the general discrete 3-IC. Additive and non-additive examples are identified for which the derived achievable rate region is the capacity, moreover, strictly larger than the current known largest achievable rate regions based on the i.i.d. random codebooks. Communication Codes Algebra Information theory AG Sahebi oth SS Pradhan oth Enthalten in IEEE transactions on information theory Piscataway, NJ : IEEE, 1963 62(2016), 3, Seite 1250 (DE-627)12954731X (DE-600)218505-2 (DE-576)01499819X 0018-9448 nnns volume:62 year:2016 number:3 pages:1250 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI GBV_ILN_65 GBV_ILN_70 GBV_ILN_2002 GBV_ILN_2088 SA 5570 AR 62 2016 3 1250 |
| language |
English |
| source |
Enthalten in IEEE transactions on information theory 62(2016), 3, Seite 1250 volume:62 year:2016 number:3 pages:1250 |
| sourceStr |
Enthalten in IEEE transactions on information theory 62(2016), 3, Seite 1250 volume:62 year:2016 number:3 pages:1250 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Communication Codes Algebra Information theory |
| dewey-raw |
070 |
| isfreeaccess_bool |
false |
| container_title |
IEEE transactions on information theory |
| authorswithroles_txt_mv |
A Padakandla @@aut@@ AG Sahebi @@oth@@ SS Pradhan @@oth@@ |
| publishDateDaySort_date |
2016-01-01T00:00:00Z |
| hierarchy_top_id |
12954731X |
| dewey-sort |
270 |
| id |
OLC1972621718 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1972621718</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220221163259.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160427s2016 xx ||||| 00| ||eng c</controlfield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160430</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1972621718</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1972621718</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)p653-168cf6f60734054b1de8dbdeaf6e2a0e2c0b266225da839fa72e39e968699d910</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0023448620160000062000301250achievablerateregionforthethreeuserinterferencecha</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">070</subfield><subfield code="a">620</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SA 5570</subfield><subfield code="q">AVZ</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">A Padakandla</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="3"><subfield code="a">An Achievable Rate Region for the Three-User Interference Channel Based on Coset Codes</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">We consider the problem of communication over a three-user discrete memoryless interference channel (3-IC). The current known coding techniques for communicating over an arbitrary 3-IC are based on message splitting, superposition coding, and binning using independent and identically distributed (i.i.d.) random codebooks. In this paper, we propose a new ensemble of codes -- partitioned coset codes (PCCs) -- that possess an appropriate mix of empirical and algebraic closure properties. We develop coding techniques that exploit the algebraic closure property of PCC to enable interference alignment over general 3-IC. We analyze the performance of the proposed coding technique to derive an achievable rate region for the general discrete 3-IC. Additive and non-additive examples are identified for which the derived achievable rate region is the capacity, moreover, strictly larger than the current known largest achievable rate regions based on the i.i.d. random codebooks.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Communication</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Codes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algebra</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information theory</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">AG Sahebi</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">SS Pradhan</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">IEEE transactions on information theory</subfield><subfield code="d">Piscataway, NJ : IEEE, 1963</subfield><subfield code="g">62(2016), 3, Seite 1250</subfield><subfield code="w">(DE-627)12954731X</subfield><subfield code="w">(DE-600)218505-2</subfield><subfield code="w">(DE-576)01499819X</subfield><subfield code="x">0018-9448</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:62</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:3</subfield><subfield code="g">pages:1250</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-BUB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-BBI</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2002</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SA 5570</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">62</subfield><subfield code="j">2016</subfield><subfield code="e">3</subfield><subfield code="h">1250</subfield></datafield></record></collection>
|
| author |
A Padakandla |
| spellingShingle |
A Padakandla ddc 070 rvk SA 5570 misc Communication misc Codes misc Algebra misc Information theory An Achievable Rate Region for the Three-User Interference Channel Based on Coset Codes |
| authorStr |
A Padakandla |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)12954731X |
| format |
Article |
| dewey-ones |
070 - News media, journalism & publishing 620 - Engineering & allied operations |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0018-9448 |
| topic_title |
070 620 DNB SA 5570 AVZ rvk An Achievable Rate Region for the Three-User Interference Channel Based on Coset Codes Communication Codes Algebra Information theory |
| topic |
ddc 070 rvk SA 5570 misc Communication misc Codes misc Algebra misc Information theory |
| topic_unstemmed |
ddc 070 rvk SA 5570 misc Communication misc Codes misc Algebra misc Information theory |
| topic_browse |
ddc 070 rvk SA 5570 misc Communication misc Codes misc Algebra misc Information theory |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| author2_variant |
a s as s p sp |
| hierarchy_parent_title |
IEEE transactions on information theory |
| hierarchy_parent_id |
12954731X |
| dewey-tens |
070 - News media, journalism & publishing 620 - Engineering |
| hierarchy_top_title |
IEEE transactions on information theory |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)12954731X (DE-600)218505-2 (DE-576)01499819X |
| title |
An Achievable Rate Region for the Three-User Interference Channel Based on Coset Codes |
| ctrlnum |
(DE-627)OLC1972621718 (DE-599)GBVOLC1972621718 (PRQ)p653-168cf6f60734054b1de8dbdeaf6e2a0e2c0b266225da839fa72e39e968699d910 (KEY)0023448620160000062000301250achievablerateregionforthethreeuserinterferencecha |
| title_full |
An Achievable Rate Region for the Three-User Interference Channel Based on Coset Codes |
| author_sort |
A Padakandla |
| journal |
IEEE transactions on information theory |
| journalStr |
IEEE transactions on information theory |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 600 - Technology |
| recordtype |
marc |
| publishDateSort |
2016 |
| contenttype_str_mv |
txt |
| container_start_page |
1250 |
| author_browse |
A Padakandla |
| container_volume |
62 |
| class |
070 620 DNB SA 5570 AVZ rvk |
| format_se |
Aufsätze |
| author-letter |
A Padakandla |
| dewey-full |
070 620 |
| title_sort |
achievable rate region for the three-user interference channel based on coset codes |
| title_auth |
An Achievable Rate Region for the Three-User Interference Channel Based on Coset Codes |
| abstract |
We consider the problem of communication over a three-user discrete memoryless interference channel (3-IC). The current known coding techniques for communicating over an arbitrary 3-IC are based on message splitting, superposition coding, and binning using independent and identically distributed (i.i.d.) random codebooks. In this paper, we propose a new ensemble of codes -- partitioned coset codes (PCCs) -- that possess an appropriate mix of empirical and algebraic closure properties. We develop coding techniques that exploit the algebraic closure property of PCC to enable interference alignment over general 3-IC. We analyze the performance of the proposed coding technique to derive an achievable rate region for the general discrete 3-IC. Additive and non-additive examples are identified for which the derived achievable rate region is the capacity, moreover, strictly larger than the current known largest achievable rate regions based on the i.i.d. random codebooks. |
| abstractGer |
We consider the problem of communication over a three-user discrete memoryless interference channel (3-IC). The current known coding techniques for communicating over an arbitrary 3-IC are based on message splitting, superposition coding, and binning using independent and identically distributed (i.i.d.) random codebooks. In this paper, we propose a new ensemble of codes -- partitioned coset codes (PCCs) -- that possess an appropriate mix of empirical and algebraic closure properties. We develop coding techniques that exploit the algebraic closure property of PCC to enable interference alignment over general 3-IC. We analyze the performance of the proposed coding technique to derive an achievable rate region for the general discrete 3-IC. Additive and non-additive examples are identified for which the derived achievable rate region is the capacity, moreover, strictly larger than the current known largest achievable rate regions based on the i.i.d. random codebooks. |
| abstract_unstemmed |
We consider the problem of communication over a three-user discrete memoryless interference channel (3-IC). The current known coding techniques for communicating over an arbitrary 3-IC are based on message splitting, superposition coding, and binning using independent and identically distributed (i.i.d.) random codebooks. In this paper, we propose a new ensemble of codes -- partitioned coset codes (PCCs) -- that possess an appropriate mix of empirical and algebraic closure properties. We develop coding techniques that exploit the algebraic closure property of PCC to enable interference alignment over general 3-IC. We analyze the performance of the proposed coding technique to derive an achievable rate region for the general discrete 3-IC. Additive and non-additive examples are identified for which the derived achievable rate region is the capacity, moreover, strictly larger than the current known largest achievable rate regions based on the i.i.d. random codebooks. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI GBV_ILN_65 GBV_ILN_70 GBV_ILN_2002 GBV_ILN_2088 |
| container_issue |
3 |
| title_short |
An Achievable Rate Region for the Three-User Interference Channel Based on Coset Codes |
| remote_bool |
false |
| author2 |
AG Sahebi SS Pradhan |
| author2Str |
AG Sahebi SS Pradhan |
| ppnlink |
12954731X |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth |
| up_date |
2024-07-03T23:52:17.008Z |
| _version_ |
1803603921610997760 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1972621718</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220221163259.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160427s2016 xx ||||| 00| ||eng c</controlfield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160430</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1972621718</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1972621718</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)p653-168cf6f60734054b1de8dbdeaf6e2a0e2c0b266225da839fa72e39e968699d910</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0023448620160000062000301250achievablerateregionforthethreeuserinterferencecha</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">070</subfield><subfield code="a">620</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SA 5570</subfield><subfield code="q">AVZ</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">A Padakandla</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="3"><subfield code="a">An Achievable Rate Region for the Three-User Interference Channel Based on Coset Codes</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">We consider the problem of communication over a three-user discrete memoryless interference channel (3-IC). The current known coding techniques for communicating over an arbitrary 3-IC are based on message splitting, superposition coding, and binning using independent and identically distributed (i.i.d.) random codebooks. In this paper, we propose a new ensemble of codes -- partitioned coset codes (PCCs) -- that possess an appropriate mix of empirical and algebraic closure properties. We develop coding techniques that exploit the algebraic closure property of PCC to enable interference alignment over general 3-IC. We analyze the performance of the proposed coding technique to derive an achievable rate region for the general discrete 3-IC. Additive and non-additive examples are identified for which the derived achievable rate region is the capacity, moreover, strictly larger than the current known largest achievable rate regions based on the i.i.d. random codebooks.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Communication</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Codes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algebra</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information theory</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">AG Sahebi</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">SS Pradhan</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">IEEE transactions on information theory</subfield><subfield code="d">Piscataway, NJ : IEEE, 1963</subfield><subfield code="g">62(2016), 3, Seite 1250</subfield><subfield code="w">(DE-627)12954731X</subfield><subfield code="w">(DE-600)218505-2</subfield><subfield code="w">(DE-576)01499819X</subfield><subfield code="x">0018-9448</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:62</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:3</subfield><subfield code="g">pages:1250</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-BUB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-BBI</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2002</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SA 5570</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">62</subfield><subfield code="j">2016</subfield><subfield code="e">3</subfield><subfield code="h">1250</subfield></datafield></record></collection>
|
| score |
7.4023743 |