Now showing items 1-8 of 8
Joint source-channel coding and guessing
We consider the joint source-channel guessing problem, define measures of optimum performance, and give single-letter characterizations. As an application, sequential decoding is considered.
Some results on zero-error capacity under list decoding
Summary form only given. A number of questions recently raised by Elias regarding a zero-error list-of-L code have been addressed. It has been shown that computing the zero-error capacity of the channel with feedback is ...
Lower bounds to moments of list size
Summary form only given. The list-size random variable L for a block code is defined as the number of incorrect messages that appear to a maximum-likelihood decoder to be at least as likely as the true message. Lower bounds ...
A bound on the zero-error list coding capacity
We present a new bound on the zero-error list coding capacity, and using which, show that the list-of-3 capacity of the 4/3 channel is at most 6/19 bits, improving the best previously known bound of 3/8. The relation of ...
Markov modulated periodic arrival process offered to an ATM multiplexer
When a superposition of on/off sources is offered to a deterministic server, a particular queueing system arises whose analysis has a significant role in ATM based networks. Periodic cell generation during active times is ...
An improved graph-entropy bound for perfect hashing
Gives an improved graph-entropy bound on the size of families of perfect hash functions. Examples are given illustrating that the new bound improves previous bounds in several instances.
An approach to manage connectionless services in connection-oriented networks
In this work we propose a pricing scheme which serves as an instrument for managing connectionless services in connection-oriented communication networks. The scheme is able to allocate network bandwidth in a Pareto-optimal ...
An inequality on guessing and its application to sequential decoding
Let (X,Y) be a pair of discrete random variables with X taking values from a finite set. Suppose the value of X is to be determined, given the value of Y, by asking questions of the form 'is X equal to x?' until the answer ...