WebSite Logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. Workshop on Network Coding, Theory and Applications (NetCod).
  2. 2008 Fourth Workshop on Network Coding, Theory and Applications
  3. Basic Entropy Sets
Loading...

Please wait, while we are loading the content...

2015 International Symposium on Network Coding (NetCod)
2014 International Symposium on Network Coding (NetCod)
2013 International Symposium on Network Coding (NetCod)
2012 International Symposium on Network Coding (NetCod)
2011 International Symposium on Networking Coding
2010 IEEE International Symposium on Network Coding (NetCod)
2009 Workshop on Network Coding, Theory, and Applications
2008 Fourth Workshop on Network Coding, Theory and Applications
Joint LDPC Codes for Multi-User Relay Channel
Network Coding meets MIMO
Robust Network Coding Using Diversity through Backup Flows
Network Spread Coding
Author index
Optimal Layered Multicast Using Network Coding
Butteries in the Mesh: Lightweight Localized Wireless Network Coding
A Joint Network-Channel Coding Technique for Single-Hop Wireless Networks
Opportunistic Cooperative Network-Coding Based on Space-Time Coding for Bi-Directional Traffic Flows
Gossiping in Networks: Towards Understanding the Power of Protocols and Network Coding
Dualities between Entropy Functions and Network Codes
Ring-theoretic foundation of convolutional network coding
The Capacity Region of Two-way Collision Networks
Efficient Information Exchange in Wireless Sensor Networks using Network Coding
On Locating Byzantine Attackers
Online Broadcasting with Network Coding
Basic Entropy Sets
"Real" and "Complex" Network Codes: Promises and Challenges
Some Recent Progresses in Network Error Correction Coding Theory
A Concatenated Network Coding Scheme for Multimedia Transmission
Network-Coded Broadcast: from Canonical Networks to Random Topologies
Rainbow Network Flow with Network Coding
A Graham-Sloane Type Construction of Constant Dimension Codes
Joint Network Coding and Subcarrier Assignment in OFDMA-Based WVireless Networks
A Unified Framework For Linear Network Codes

Similar Documents

...
Dualities between Entropy Functions and Network Codes

Article

...
Entropy Vectors and Network Codes

Article

...
Network coding capacity: A functional dependence bound

Article

...
On capacity regions of non-multicast networks

Article

...
On the Continuity of Achievable Rate Regions for Source Coding over Networks

Article

...
Dualities Between Entropy Functions and Network Codes

Article

...
Scalar Linear Network Coding for Networks with Two Sources

Article

...
On secure network coding with uniform wiretap sets

Article

...
Weighted sum-rate functional dependence bound for network coding capacity

Article

Basic Entropy Sets

Content Provider IEEE Xplore Digital Library
Author Grivell, I. Grant, A. Chan, T.
Copyright Year 2008
Description Author affiliation: Mil. Commun. Branch, Edinburgh (Grivell, I.)
Abstract The entropy space for n random variables has dimension $2^{n}$ -1, one dimension for each joint entropy. When the random variables are known to satisfy given functional dependence relationships, the dimension may be smaller. In this paper, we identify a basis for the restriction of the entropy space to distributions satisfying functional dependence relations specified by an acyclic graph. We provide an efficient algorithm for determination of this basis. One application is a reduction in the computational effort required to compute the linear programming bound for multi-source network coding.
Starting Page 1
Ending Page 6
File Size 1596761
Page Count 6
File Format PDF
ISBN 9781424416899
DOI 10.1109/NETCOD.2008.4476184
Language English
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date 2008-01-03
Publisher Place China
Access Restriction Subscribed
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword Military communication Space technology Network coding Lakes Linear programming Entropy Computer networks Regions Random variables Australia
Content Type Text
Resource Type Article
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
  • Chat with Us
About National Digital Library of India (NDLI)
NDLI logo

National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.

Learn more about this project from here.

Disclaimer

NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.

Feedback

Sponsor

Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.

Contact National Digital Library of India
Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302
See location in the Map
03222 282435
Mail: support@ndl.gov.in
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
I will try my best to help you...
Cite this Content
Loading...