NDLI: Optimality of network coding with buffers

Please wait, while we are loading the content...

2011 IEEE Information Theory Workshop

Lattice codes for the compute-and-forward protocol: The flatness factor

Flip-OFDM for optical wireless communications

Generalized distributive law for ML decoding of STBCs

Approaching the capacity of sampled analog channels

Symmetric group testing and superimposed codes

An algorithmic approach for finding deletion correcting codes

Self-Repairing Codes for distributed storage — A projective geometric construction

The expected write deficiency of index-less flash codes and their improvement

Non-binary WOM-codes for multilevel flash memories

Quasicyclic MDS codes for distributed storage with efficient exact repair

Embedding information flows into renewal traffic

Non-malleable codes from the wire-tap channel

Capacity results for compound wiretap channels

Secret message capacity of erasure broadcast channels with feedback

Secrecy gain of trellis codes: The other side of the union bound

On multiple hypothesis testing with rejection option

Exponential pattern retrieval capacity with non-binary associative memory

Capacity of diffusion-based molecular communication with ligand receptors

Mutation and optimal search of sequences in nested Hamming spaces

Voice pathology detection with predictable component analysis and wavelet decomposition model

A strictly improved achievable region for multiple descriptions using combinatorial message sharing

An optimal transmit-receive rate tradeoff in Gray-Wyner network and its relation to common information

A lattice compress-and-forward scheme

Decode-forward and compute-forward coding schemes for the two-way relay channel

An achievable region for the double unicast problem based on a minimum cut analysis

Optimal rate for irregular LDPC codes in binary erasure channel

Reducing complexity with less than minimum delay space-time lattice codes

Diversity-multiplexing gain tradeoff: A tool in algebra?

Graph-based codes for Quantize-Map-and-Forward relaying

MAP decoding for LDPC codes over the binary erasure channel

On bent functions associated to AB functions

Quasi-orthogonal supersets

Spectral shaping codes with even length permutation sequences

Ambiguity and deficiency of permutations from finite fields

Three-dimensional periodic optical orthogonal code for OCDMA systems

Ultra-small block-codes for binary discrete memoryless channels

State-dependent channels with composite state information at the encoder

On the capacity of noisy computations

Continuous-time directed information and its role in communication

Capacity bounds for multiuser channels with non-causal channel state information at the transmitters

Finite block-length achievable rates for queuing timing channels

Information-theoretic analysis of content based identification for correlated data

On the eavesdropper's correct decision in Gaussian and fading wiretap channels using lattice codes

A lattice-based batch identification scheme

Decoding q-ary lattices in the Lee metric

Minimal codes in binary abelian group algebras

List-decoding of binary Goppa codes up to the binary Johnson bound

Asymmetric quantum generalized Reed-Solomon codes

Robustness of statistical mechanical interpretation of algorithmic information theory

Helstrom's theory on quantum binary decision revisited

Quantum search algorithms on hierarchical networks

Quantum turbo codes with unbounded minimum distance and excellent error-reducing performance

Iterative soft decoding of binary linear codes using a generalized Tanner graph

On-line fountain codes for semi-random loss channels

Multi-edge framework for unequal error protecting LT codes

Annotated raptor codes

Universal rateless codes from coupled LT codes

A distinguisher for high rate McEliece cryptosystems

Information-theoretically secure key-insulated key-agreement

LWE-based identification schemes

Identification in desynchronization channels

A tree construction method of nested cyclic codes

A half-duplex relay coding scheme optimized for energy efficiency

Amplify-and-forward in wireless relay networks

An information theoretic approach for determining the minimum number of sensors in a wireless sensor network

Binary arithmetic coding for time-varying sources based on the Maskit boundary

Optimal HDA codes for sending a Gaussian source over a Gaussian channel with bandwidth compression in the presence of an interference

Operating LDPC codes with zero shaping gap

Multi-edge type unequal error protecting low-density parity-check codes

Ensemble analysis of pseudocodewords of protograph-based non-binary LDPC codes

On the selection of finite alphabet iterative decoders for LDPC codes on the BSC

Quasi-cyclic LDPC codes based on pre-lifted protographs

Precoding for coded communication on block fading channels and cooperative communications

High SNR bounds for the BICM capacity

Communications overhead as the cost of constraints

Equivalent models for multi-terminal channels

A maximum entropy theorem for complex-valued random vectors, with implications on capacity

Subspace based multi-dimensional model order selection in colored noise scenarios

Sign-magnitude decomposition of mutual information with polarization effect in digital identification

Widely linear SIMO filtering for hypercomplex numbers

Towards an optimal beamforming algorithm for physical layer multicasting

Incremental coding over MIMO channels

Algebraic solvers for certain lattice-related problems

Search to decision reduction for the learning with errors over rings problem

The tightness of security reductions in code-based cryptography

Quantized compute and forward: A low-complexity architecture for distributed antenna systems

A converse for the wideband relay channel with physically degraded broadcast

On message lengths for noisy network coding

Capacity bounds for the Z channel

Communicating degraded message sets over multi-access channels with degraded encoder state information

Interference alignment at finite SNR for time-invariant channels

Feasibility of interference alignment for the MIMO interference channel: The symmetric square case

On the capacity of multiplicative multiple access channels with AWGN

Fixed-length lossy compression in the finite blocklength regime: Gaussian source

Lossy source coding with Byzantine adversaries

Coordination using implicit communication

Achievability of maximum decoding rate on sequential coding

On the network-wide gain of memory-assisted source coding

Kite codes over groups

A standard form for generator matrices with respect to the Niederreiter-Rosenbloom-Tsfasman metric

MacWilliams-type identity in poset-block spaces

Zero-error codes for the noisy-typewriter channel

Binary error correcting network codes

XOR's, lower bounds and MDS codes for storage

A Knuth-based RDS-minimizing multi-mode code

Rate-compatible LDPC convolutional codes for capacity-approaching hybrid ARQ

Gigabit rate low-power LDPC decoder

On network coding for acyclic networks with delays

On the optimal block length for joint channel and network coding

Optimality of network coding with buffers

Exact modeling of the performance of random linear network coding in finite-buffer networks

Full-diversity network coding for two-user cooperative communications

A compressed sensing wire-tap channel

Analysis of MMSE estimation for compressive sensing of block sparse signals

Covering radius and the Restricted Isometry Property

Secrecy using compressive sensing

Critical compression ratio of iterative reweighted l1 minimization for compressed sensing

A generalized network alignment for three-source three-destination multiple unicast networks with delays

Relay-assisted multiple access with multi-packet reception capability and simultaneous transmission and reception

Error propagation and the achievable throughput-delay trade-off in wireless networks

On the sum capacity of multiaccess block-fading channels with individual side information

Unchaining from the channel: Cooperative computation over multiple-access channels

Optimal utilization of a cognitive shared channel with a rechargeable primary source node

Threshold effects in parameter estimation as phase transitions in statistical physics

Sufficient conditions for the convergence of the Shannon differential entropy

Necessary and sufficient conditions for zero-rate density estimation

An immune-inspired information-theoretic approach to the problem of ICA over a Galois field

On the generalization of decode-and-forward and compress-and-forward for Gaussian relay channels

Multiple access channel with correlated channel states and cooperating encoders

2-Dimensional interval algorithm

Efficient fully simulatable oblivious transfer from the McEliece assumptions

Enumerative encoding of correlation immune Boolean functions

A new zero-knowledge code based identification scheme with reduced communication

On the separation of encryption and compression in secure distributed source coding

Key agreement in state-dependent channels with non-causal side information

Existence and uniqueness of GEXIT curves via the Wasserstein metric

Coupled LDPC codes: Complexity aspects of threshold saturation

Percolation in the secrecy graph: Bounds on the critical probability and impact of power constraints

Hybrid digital/analog schemes for secure transmission with side information

A note on non-binary multiple insertion/deletion correcting codes

Extended bit-flipping algorithm for solving sparse linear systems of equations modulo p

New cyclically permutable codes

Generating dependent random variables over networks

Towards the capacity region of multiplicative linear operator broadcast channels

Completion time in multi-access channel: An information theoretic perspective

Bidirectional broadcast channels with common and confidential messages

Secrecy gain of Gaussian wiretap codes from unimodular lattices

Linear perfect secret key agreement

2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo)

2009 IEEE Information Theory Workshop on Networking and Information Theory

2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks

2006 IEEE Information Theory Workshop - ITW '06 Punta del Este

IEEE Information Theory Workshop, 2005.

Information Theory Workshop

Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)

Proceedings of the IEEE Information Theory Workshop

Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)

1998 Information Theory Workshop (Cat. No.98EX131)

Optimality of network coding with buffers

Content Provider	IEEE Xplore Digital Library
Author	Haeupler, B. MinJi Kim Medard, M.
Copyright Year	2011
Description	Author affiliation: RLE, CSAIL, Massachusetts Institute of Technology (Haeupler, B.) \|\| RLE, Massachusetts Institute of Technology (MinJi Kim; Medard, M.)
Abstract	We analyze distributed and packetized implementations of random linear network coding (PNC) with buffers. In these protocols, nodes store received packets to later produce coded packets that reflect this information. We show the optimality of PNC for any buffer size; i.e., we show that PNC performs at least as good as any protocols with the same buffer size. In other words, a multicast task completes at exactly the first time in which in hindsight it was possible to route information from the sources to each receiver individually given the buffer constraint, i.e., that the buffer used at each node never exceeds its buffer size. This shows that PNC, even without any feedback or explicit buffer management, allows to keep minimal buffer sizes while maintaining its optimal performance.
Starting Page	533
Ending Page	537
File Size	388440
Page Count	5
File Format	PDF
ISBN	9781457704383
e-ISBN	9781457704376
DOI	10.1109/ITW.2011.6089559
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-10-16
Publisher Place	Brazil
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Protocols Network coding Transforms Encoding Schedules Vectors
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

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