NDLI: Unachievability of network coding capacity

Content Provider	IEEE Xplore Digital Library
Author	Dougherty, R. Freiling, C. Zeger, K.
Copyright Year	1963
Abstract	The coding capacity of a network is the supremum of ratios k/n, for which there exists a fractional (k,n) coding solution, where k is the source message dimension and n is the maximum edge dimension. The coding capacity is referred to as routing capacity in the case when only routing is allowed. A network is said to achieve its capacity if there is some fractional (k,n) solution for which k/n equals the capacity. The routing capacity is known to be achievable for arbitrary networks. We give an example of a network whose coding capacity (which is 1) cannot be achieved by a network code. We do this by constructing two networks, one of which is solvable if and only if the alphabet size is odd, and the other of which is solvable if and only if the alphabet size is a power of 2. No linearity assumptions are made.
Sponsorship	IEEE Information Theory Society
Starting Page	2365
Ending Page	2372
Page Count	8
File Size	248995
File Format	PDF
ISSN	00189448
Volume Number	52
Issue Number	6
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-06-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Network coding Routing Decoding Linear code Linearity Wireless communication Mathematics switching Capacity flow network coding
Content Type	Text
Resource Type	Article
Subject	Library and Information Sciences Information Systems Computer Science Applications

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

Network routing capacity

Network Coding Capacity With a Constrained Number of Coding Nodes

Linear network coding

Linear Codes, Target Function Classes, and Network Computing Capacity

Two-Flow Capacity Region of the COPE Principle for Wireless Butterfly Networks With Broadcast Erasure Channels

Variable-Rate Linear Network Coding

Insufficiency of linear coding in network information flow

Linearity and solvability in multicast networks

Separating distributed source coding from network coding

Unachievability of network coding capacity

Similar Documents

Network routing capacity

Network Coding Capacity With a Constrained Number of Coding Nodes

Linear network coding

Linear Codes, Target Function Classes, and Network Computing Capacity

Two-Flow Capacity Region of the COPE Principle for Wireless Butterfly Networks With Broadcast Erasure Channels

Variable-Rate Linear Network Coding

Insufficiency of linear coding in network information flow

Linearity and solvability in multicast networks

Separating distributed source coding from network coding

Unachievability of network coding capacity