On the capacity of information networks
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Edge-Cut Bounds on Network Coding Rates
Journal of Network and Systems Management
On the capacity of information networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Foundations and Trends® in Networking
Topics in Multi-User Information Theory
Foundations and Trends in Communications and Information Theory
The capacity of channels with feedback
IEEE Transactions on Information Theory
Outer bounds for multiple-access channels with feedback using dependence balance
IEEE Transactions on Information Theory
Finite state channels with time-invariant deterministic feedback
IEEE Transactions on Information Theory
A formulation of the channel capacity of multiple-access channel
IEEE Transactions on Information Theory
Capacity region of the finite-state multiple-access channel with and without feedback
IEEE Transactions on Information Theory
Feedback capacity of the compound channel
IEEE Transactions on Information Theory
A new achievable rate region for the discrete memoryless multiple-access channel with feedback
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Two-way source coding with a common helper
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Directed information and causal estimation in continuous time
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Directed information, causal estimation, and communication in continuous time
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
IEEE Transactions on Information Theory
A sequential transmission scheme for the multiple access channel with noiseless feedback
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
On the sum capacity of the Gaussian multiple access channel with feedback
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
The capacity region of the degraded finite-state broadcast channel
IEEE Transactions on Information Theory
Two-way source coding with a helper
IEEE Transactions on Information Theory
IEEE Transactions on Communications
On the AWGN MAC with imperfect feedback
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Hi-index | 755.50 |
A discrete memoryless network (DMN) is a memoryless multiterminal channel with discrete inputs and outputs. A sequence of inner bounds to the DMN capacity region is derived by using code trees. Capacity expressions are given for three classes of DMNs: (1) a single-letter expression for a class with a common output, (2) a two-letter expression for a binary-symmetric broadcast channel (BC) with partial feedback, and (3) a finite-letter expression for push-to-talk DMNs. The first result is a consequence of a new capacity outer bound for common output DMNs. The third result demonstrates that the common practice of using a time-sharing random variable does not include all time-sharing possibilities, namely, time sharing of channels. Several techniques for improving the bounds are developed: (1) causally conditioned entropy and directed information simplify the inner bounds, (2) code trellises serve as simple code trees, (3) superposition coding and binning with code trees improves rates. Numerical computations show that the last technique enlarges the best known rate regions for a multiple-access channel (MAC) and a BC, both with feedback. In addition to the rate bounds, a sequence of inner bounds to the DMN reliability function is derived. A numerical example for a two-way channel illustrates the behavior of the error exponents.