DocumentCode
253304
Title
Network embedding operations preserving the insufficiency of linear network codes
Author
Congduan Li ; Weber, Simon ; Walsh, John MacLaren
Author_Institution
ECE Dept., Drexel Univ., Philadelphia, PA, USA
fYear
2014
fDate
Sept. 30 2014-Oct. 3 2014
Firstpage
1333
Lastpage
1340
Abstract
Operations for extending/embedding a smaller network into a larger network that preserve the insufficiency of classes of linear network codes are presented. Linear network codes over some finite field are said to be sufficient for a network if and only if for every point in the network coding rate region, there exists a code over that finite field to achieve it. Three operations are defined, and it is proven that they have the desired inheritance property, both for scalar linear network codes and for vector linear network codes, separately. Experimental results on the rate regions of multilevel diversity coding systems (MDCS), a sub-class of the broader family of multi-source multi-sink networks with special structure, are presented for demonstration. These results demonstrate that these notions of embedding operations enable one to investigate the existences of small numbers of forbidden network minors for sufficiency of linear network codes over a given field.
Keywords
linear codes; network coding; MDCS; inheritance property; linear network codes; multilevel diversity coding systems; network coding rate region; network embedding operations; scalar linear network codes; vector linear network codes; Artificial neural networks; Entropy; Linear codes; Network coding; Random variables; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Communication, Control, and Computing (Allerton), 2014 52nd Annual Allerton Conference on
Conference_Location
Monticello, IL
Type
conf
DOI
10.1109/ALLERTON.2014.7028610
Filename
7028610
Link To Document