NDLI: Generalized cut-set bounds for broadcast networks

Content Provider	IEEE Xplore Digital Library
Author	Salimi, A. Tie Liu Shuguang Cui
Copyright Year	2013
Description	Author affiliation: Dept. of Electr. & Comput. Eng., Texas A&M Univ., College Station, TX, USA (Salimi, A.; Tie Liu; Shuguang Cui)
Abstract	An explicit characterization of the capacity region of the general network coding problem is one of the best known open problems in information theory. A simple set of bounds that are often used in the literature to show that certain rate tuples are infeasible are based on the graph-theoretic notion of cut. The standard cut-set bounds, however, are known to be loose in general when there are multiple messages to be communicated in the network. This paper focuses on broadcast networks, for which the standard cut-set bounds are closely related to union as a specific set operation to combine different simple cuts of the network. A new set of explicit network coding bounds, which combine different simple cuts of the network via a variety of set operations (not just the union), are established via their connections to extremal inequalities for submodular functions. The tightness of these bounds are demonstrated via applications to combination networks.
Sponsorship	IEEE Cont. Syst. Soc.
Starting Page	832
Ending Page	838
File Size	510092
Page Count	7
File Format	PDF
e-ISBN	9781479934102
DOI	10.1109/Allerton.2013.6736611
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-10-02
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Gold Unicast Network coding Silicon Encoding Standards
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Generalized Cut-Set Bounds for Broadcast Networks

Generalized cut-set bounds for networks with collocated messages

On the Generalized Network Sharing bound and edge-cut bounds for network coding

Research on network coding based Hybrid-ARQ scheme for wireless networks

3 Generalized Cut-Set Bounds for Broadcast Networks (2013)

Reverse edge cut-set bounds for secure network coding

Cut-set bound for generalized networks with deterministic channels

Generalized Network Sharing Outer Bound and the Two-Unicast Problem

An information-theoretic meta-theorem on edge-cut bounds

Generalized cut-set bounds for broadcast networks

Similar Documents

Generalized Cut-Set Bounds for Broadcast Networks

Generalized cut-set bounds for networks with collocated messages

On the Generalized Network Sharing bound and edge-cut bounds for network coding

Research on network coding based Hybrid-ARQ scheme for wireless networks

3 Generalized Cut-Set Bounds for Broadcast Networks (2013)

Reverse edge cut-set bounds for secure network coding

Cut-set bound for generalized networks with deterministic channels

Generalized Network Sharing Outer Bound and the Two-Unicast Problem

An information-theoretic meta-theorem on edge-cut bounds

Generalized cut-set bounds for broadcast networks