Now showing items 1-4 of 4
Detection of Binary Sources Over Discrete Channels with Additive Markov Noise
We consider the problem of directly transmitting a binary source with an inherent redundancy over a binary channel with additive stationary ergodic Markov noise. Out objective is to design an optimum receiver which fully ...
The Performance of Focused Error Control Codes
Consider an additive noise channel with inputs and outputs in the field GF (q ) where q > 2; every time a symbol is transmitted over such a channel, there are q - 1 different errors that can occur, corresponding to the q ...
A Generalized Gilbert-Varshamov Bound Derived via Analysis of a Code-Search Algorithm
This correspondence derives a generalization of the Gilbert- Varshamov bound that is applicable to block codes whose codewords must be drawn from irregular sets; the bound improves by a factor of four a similar result ...
A Communication Channel Modeled on Contagion
We introduce a binary additive communication channel with memory. The noise process of the channel is generated according to the contagion model of George Polya; our motivation is the empirical observation of Stapper et. ...