Codes are constructed for communicating an alphabet consisting of two letters over an unknown, stationary binary channel. The code words, their a priori probabilities, and channel parameters are unknown at the receiver. Consistent estimators for the code words and their a priori probabilities are constructed at the receiver
AbstractWe consider error correction over the Non-Binary Symmetric Channel (NBSC) which is a natural...
It is shown that the capacity Cb of a stationary nonanticipatory channel with respect to block codin...
We describe parallel concatenated codes for communication over binary-input, binary-output hidden Ma...
Codes are constructed for communicating an alphabet consisting of two letters over an unknown, stati...
AbstractConsider a sender transmitting a given sequence of bits simultaneously through m binary symm...
Contains reports on one research project.National Aeronautics and Space Administration (Grant NsG-33...
A discrete memoryless two-way channel is defined by a set of transmission probabilities {p(y, y¯/x, ...
Ahlswede R, Wolfowitz J. The capacity of a channel with arbitrarily varying channel probability func...
We consider the problem of lossy source coding for transmission across an unknown or time-varying no...
We study the information processing properties of a binary channel receiving data from a gaussian so...
Two low-complexity methods are proposed for sequential probability assignment for binary independent...
In this paper, the bit error probability P(sub b) for maximum likelihood decoding of binary linear c...
"May 25, 1955"--Cover. "Reprinted from the IRE transactions of the professional group on information...
We consider the joint source-channel guessing problem, define measures of optimum performance, and g...
The paper briefly discusses techniques for making vector quantizers more tolerant to tranmsission er...
AbstractWe consider error correction over the Non-Binary Symmetric Channel (NBSC) which is a natural...
It is shown that the capacity Cb of a stationary nonanticipatory channel with respect to block codin...
We describe parallel concatenated codes for communication over binary-input, binary-output hidden Ma...
Codes are constructed for communicating an alphabet consisting of two letters over an unknown, stati...
AbstractConsider a sender transmitting a given sequence of bits simultaneously through m binary symm...
Contains reports on one research project.National Aeronautics and Space Administration (Grant NsG-33...
A discrete memoryless two-way channel is defined by a set of transmission probabilities {p(y, y¯/x, ...
Ahlswede R, Wolfowitz J. The capacity of a channel with arbitrarily varying channel probability func...
We consider the problem of lossy source coding for transmission across an unknown or time-varying no...
We study the information processing properties of a binary channel receiving data from a gaussian so...
Two low-complexity methods are proposed for sequential probability assignment for binary independent...
In this paper, the bit error probability P(sub b) for maximum likelihood decoding of binary linear c...
"May 25, 1955"--Cover. "Reprinted from the IRE transactions of the professional group on information...
We consider the joint source-channel guessing problem, define measures of optimum performance, and g...
The paper briefly discusses techniques for making vector quantizers more tolerant to tranmsission er...
AbstractWe consider error correction over the Non-Binary Symmetric Channel (NBSC) which is a natural...
It is shown that the capacity Cb of a stationary nonanticipatory channel with respect to block codin...
We describe parallel concatenated codes for communication over binary-input, binary-output hidden Ma...