A general approach to random coding for multi-terminal networks

Stefano Rini; Andrea Goldsmith

doi:10.1109/ITA.2013.6502971

A general approach to random coding for multi-terminal networks

Stefano Rini, Andrea Goldsmith

Research output: Contribution to conference › Paper › peer-review

14 Scopus citations

Abstract

We introduce a general framework to derive achievable rate regions based on random coding for any memoryless, single-hop, multi-terminal network. We show that this general inner bound may be obtained from a graph representation that captures the statistical relationship among codewords and allows one to readily obtain the rate bounds under which the error probability vanishes as the block-length goes to infinity. The proposed graph representation naturally leads to an "automatic rate region derivator" which produces achievable rate regions combining classic random coding techniques such as coded timesharing, rate-splitting, superposition coding and binning for the general memoryless network under consideration.

Original language	English (US)
Pages	335-343
Number of pages	9
DOIs	https://doi.org/10.1109/ITA.2013.6502971
State	Published - 2013
Externally published	Yes
Event	2013 Information Theory and Applications Workshop, ITA 2013 - San Diego, CA, United States Duration: Feb 10 2013 → Feb 15 2013

Other

Other	2013 Information Theory and Applications Workshop, ITA 2013
Country/Territory	United States
City	San Diego, CA
Period	2/10/13 → 2/15/13

All Science Journal Classification (ASJC) codes

Computer Science Applications
Information Systems

Keywords

achievable region
binning
chain graph
coded time-sharing
multi-terminal network
rate-splitting
superposition

Access to Document

10.1109/ITA.2013.6502971

Cite this

@conference{4c12d51d0cbb41bea9640ad68aea695b,

title = "A general approach to random coding for multi-terminal networks",

abstract = "We introduce a general framework to derive achievable rate regions based on random coding for any memoryless, single-hop, multi-terminal network. We show that this general inner bound may be obtained from a graph representation that captures the statistical relationship among codewords and allows one to readily obtain the rate bounds under which the error probability vanishes as the block-length goes to infinity. The proposed graph representation naturally leads to an {"}automatic rate region derivator{"} which produces achievable rate regions combining classic random coding techniques such as coded timesharing, rate-splitting, superposition coding and binning for the general memoryless network under consideration.",

keywords = "achievable region, binning, chain graph, coded time-sharing, multi-terminal network, rate-splitting, superposition",

author = "Stefano Rini and Andrea Goldsmith",

year = "2013",

doi = "10.1109/ITA.2013.6502971",

language = "English (US)",

pages = "335--343",

note = "2013 Information Theory and Applications Workshop, ITA 2013 ; Conference date: 10-02-2013 Through 15-02-2013",

}

TY - CONF

T1 - A general approach to random coding for multi-terminal networks

AU - Rini, Stefano

AU - Goldsmith, Andrea

PY - 2013

Y1 - 2013

N2 - We introduce a general framework to derive achievable rate regions based on random coding for any memoryless, single-hop, multi-terminal network. We show that this general inner bound may be obtained from a graph representation that captures the statistical relationship among codewords and allows one to readily obtain the rate bounds under which the error probability vanishes as the block-length goes to infinity. The proposed graph representation naturally leads to an "automatic rate region derivator" which produces achievable rate regions combining classic random coding techniques such as coded timesharing, rate-splitting, superposition coding and binning for the general memoryless network under consideration.

AB - We introduce a general framework to derive achievable rate regions based on random coding for any memoryless, single-hop, multi-terminal network. We show that this general inner bound may be obtained from a graph representation that captures the statistical relationship among codewords and allows one to readily obtain the rate bounds under which the error probability vanishes as the block-length goes to infinity. The proposed graph representation naturally leads to an "automatic rate region derivator" which produces achievable rate regions combining classic random coding techniques such as coded timesharing, rate-splitting, superposition coding and binning for the general memoryless network under consideration.

KW - achievable region

KW - binning

KW - chain graph

KW - coded time-sharing

KW - multi-terminal network

KW - rate-splitting

KW - superposition

UR - http://www.scopus.com/inward/record.url?scp=84877647749&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84877647749&partnerID=8YFLogxK

U2 - 10.1109/ITA.2013.6502971

DO - 10.1109/ITA.2013.6502971

M3 - Paper

AN - SCOPUS:84877647749

SP - 335

EP - 343

T2 - 2013 Information Theory and Applications Workshop, ITA 2013

Y2 - 10 February 2013 through 15 February 2013

ER -

A general approach to random coding for multi-terminal networks

Abstract

Other

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this