Result: Network Coding in Node-Constrained Line and Star Networks

Title:
Network Coding in Node-Constrained Line and Star Networks
Authors:
SADEGH TABATABAEI YAZDI, S. M, SAVARI, Serap A, KRAMER, Gerhard
Source:
IEEE transactions on information theory. 57(7):4452-4468
Publisher Information:
New York, NY: Institute of Electrical and Electronics Engineers, 2011.
Publication Year:
2011
Physical Description:
print, 38 ref
Original Material:
INIST-CNRS
Subject Terms:
Telecommunications, Télécommunications, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Telecommunications et theorie de l'information, Telecommunications and information theory, Théorie de l'information, du signal et des communications, Information, signal and communications theory, Théorie de l'information, Information theory, Théorie du signal et des communications, Signal and communications theory, Codage, codes, Coding, codes, Télécommunications, Telecommunications, Systèmes, réseaux et services de télécommunications, Systems, networks and services of telecommunications, Commutation et signalisation, Switching and signalling, Transmission et modulation (techniques et équipements), Transmission and modulation (techniques and equipments), Borne supérieure, Upper bound, Cota superior, Codage binaire, Binary coding, Codificación binaria, Codage linéaire, Linear coding, Codificación lineal, Code linéaire, Linear code, Código lineal, Code optimal, Optimal code, Código optimal, Commutation paquet, Packet switching, Conmutación por paquete, Diffusion donnée, Data broadcast, Difusion dato, Diffusion information, Information dissemination, Difusión información, Graphe orienté, Directed graph, Grafo orientado, Multidestinataire, Multicast, Multidestinatario, Noeud structure, Nodes, Nudo estructura, Optimisation combinatoire, Combinatorial optimization, Optimización combinatoria, Problème combinatoire, Combinatorial problem, Problema combinatorio, Réseau étoile, Star network, Red estrella, Codage de réseau, Network coding, Index coding, line network, linear network coding, network coding, node-constrained network, star network
Document Type:
Academic journal Article
File Description:
text
Language:
English
Author Affiliations:
Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX, 77843, United States
Institute for Communications Engineering, Technische Universitat München (TUM), München, Germany
ISSN:
0018-9448
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=24327929
Rights:
Copyright 2015 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Telecommunications and information theory
Accession Number:
edscal.24327929
Database:
PASCAL Archive

Further Information

Line and star networks with both node and edge constraints are studied in the network coding framework. For line networks, the capacity region of the general multiple multicast problem is established. The coding theorem is based on a binary linear coding scheme, while the converse requires new upper bounds that improve on standard cut-based bounds. For star networks, the multiple unicast problem is examined. Capacity upper bounds are derived and a simple linear coding scheme is proposed which is based on the combinatorial optimization problem of cycle packing in directed graphs. The optimality of this scheme is established for a broad class of demands. The connection of node-constrained network coding in star networks, and index coding with side information is discussed and used to partially characterize the optimal linear code for general rates.