Search
Now showing items 1-7 of 7
Detection of Binary Sources Over Discrete Channels with Additive Markov Noise
(1994)
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 Reliability of Systems with Two Levels of Fault Tolerance: The Return of the "Birthday Surprise"
(1990)
This paper considers the reliability of systems that employ fault tolerance at two different hierarchical levels. Specifically, it assumes the system consists of a two-dimensional array of components. Each component is ...
The Performance of Focused Error Control Codes
(1990)
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
(1992)
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
(1993)
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. ...
Optical Orthogonal Codes with Unequal Auto- and Cross- Correlation Constraints
(1992)
An optical orthogonal code (OOC)is collection of binary sequences with good auto-and cross-correlation properties; they were defined by Salehi and others as a means of obtaining code division multiple access on optical ...
Distributed Decoding of Cyclic Block Codes Using a Generalization of Majority-Logic Decoding
(1992)
One-step majority-logic decoding is one of the simplest algorithms for decoding cyclic block codes. However, it is an effective decoding scheme for very few codes. This paper presents a generalization based on the ...