Title :
A new computational approach for determining rate regions and optimal codes for coded networks
Author :
Congduan Li ; Apte, Julia ; Walsh, John MacLaren ; Weber, Simon
Author_Institution :
Dept. of ECE, Drexel Univ., Philadelphia, PA, USA
Abstract :
A new computational technique is presented for determining rate regions for coded networks. The technique directly manipulates the extreme ray representation of inner and outer bounds for the region of entropic vectors. We use new inner bounds on region of entropic vectors based on conic hull of ranks of representable matroids. In particular, the extreme-ray representations of these inner bounds are obtained via matroid enumeration and minor exclusion. This is followed by a novel use of iterations of the double description method to obtain the desired rate regions. Applications in multilevel diversity coding systems (MDCS) are discussed as an example. The special structure of the problem that makes this technique inherently fast along with being scalable is also discussed. Our results demonstrate that for each of the 31 2-level 3-encoder and the 69 3-level 3-encoder MDCS configurations, if scalar linear codes (over any field) suffice to achieve the rate region, then in fact binary scalar linear codes suffice. For the 31 2-level 3-encoder cases where scalar codes are insufficient we demonstrate that vector linear codes suffice and provide some explicit constructions of these codes.
Keywords :
binary codes; linear codes; network coding; MDCS; binary scalar linear code; coded network; computational approach; conic hull; double description method; entropic vector region; extreme ray representation; inner bound; multilevel diversity coding systems; optimal code; outer bound; rate region determination; Decoding; Entropy; Linear code; Random variables; Vectors;
Conference_Titel :
Network Coding (NetCod), 2013 International Symposium on
Conference_Location :
Calgary, AB
Print_ISBN :
978-1-4799-0821-9
DOI :
10.1109/NetCod.2013.6570825