NDLI: A new computational approach for determining rate regions and optimal codes for coded networks

Content Provider	IEEE Xplore Digital Library
Author	Congduan Li Apte, J. Walsh, J.M. Weber, S.
Copyright Year	2013
Description	Author affiliation: Dept. of ECE, Drexel Univ., Philadelphia, PA, USA (Congduan Li; Apte, J.; Walsh, J.M.; Weber, S.)
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.
Starting Page	1
Ending Page	6
File Size	738503
Page Count	6
File Format	PDF
ISBN	9781479908219
e-ISBN	9781479908233
DOI	10.1109/NetCod.2013.6570825
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-06-07
Publisher Place	Canada
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Linear code Vectors Entropy Random variables Decoding
Content Type	Text
Resource Type	Article

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

A computational approach for determining rate regions and codes using entropic vector bounds

Ensemble Analysis on Syndrome Entropy of Binary Linear Codes

Nested lattice codes for arbitrary continuous sources and channels

An achievable rate-distortion region for the multiple descriptions problem

A simple one sweep algorithm for optimal APP symbol decoding of linear block codes

High-rate sparse superposition codes with iteratively optimal estimates

Upper bounds on the rate of LDPC codes as a function of minimum distance

Low-complexity near-optimal codes for Gaussian relay networks

A factor-graph-based random walk, and its relevance for LP decoding analysis and Bethe entropy characterization

A new computational approach for determining rate regions and optimal codes for coded networks

Similar Documents

A computational approach for determining rate regions and codes using entropic vector bounds

Ensemble Analysis on Syndrome Entropy of Binary Linear Codes

Nested lattice codes for arbitrary continuous sources and channels

An achievable rate-distortion region for the multiple descriptions problem

A simple one sweep algorithm for optimal APP symbol decoding of linear block codes

High-rate sparse superposition codes with iteratively optimal estimates

Upper bounds on the rate of LDPC codes as a function of minimum distance

Low-complexity near-optimal codes for Gaussian relay networks

A factor-graph-based random walk, and its relevance for LP decoding analysis and Bethe entropy characterization

A new computational approach for determining rate regions and optimal codes for coded networks