Channels with intermittent errors
Arya Mazumdar,Alexander Barg +1 more
- pp 1753-1757
Reads0
Chats0
TLDR
A probabilistic model of a binary channel with non-adjacent errors and the capacity of this channel are defined and some constructions are provided.Abstract:
We study coding for binary channels in which out of any two consecutive transmitted bits at most one can be affected by errors. We consider a set of basic coding problems for such channels, deriving estimates on the size of optimal codes and providing some constructions. We also study a generalization to errors separated by at least s = 2, 3, … error-free channel uses. Finally, we define a probabilistic model of a binary channel with non-adjacent errors and find the capacity of this channel.read more
Citations
More filters
Journal ArticleDOI
Capacity Bounds and Concatenated Codes over Segmented Deletion Channels
TL;DR: An information theoretic characterization and a practical coding approach for segmented deletion channels that argue that such channels are information stable, hence their channel capacity exists and offers a significantly larger transmission rate compared to the other existing solutions in the literature.
Dissertation
Combinatorial methods in coding theory
Alexander Barg,Arya Mazumdar +1 more
TL;DR: This thesis establishes the exact asymptotic behavior of the size of codes for rank modulation and suggests a number of new general constructions of such codes based on properties of finite fields as well as combinatorial considerations.
Proceedings ArticleDOI
On 2-D non-adjacent-error channel models
K. M. Shivkumar,Navin Kashyap +1 more
TL;DR: This work obtains an expression for the capacity of the 2-D non-adjacent-errors channel and derives an upper bound for the asymptotic coding rate in the combinatorial model.
Proceedings ArticleDOI
Correcting Deletions in Probabilistic Non-Binary Segmented Burst Deletion Channels
Chen Yi,Jorg Kliewer +1 more
TL;DR: This work proposes to solely use binary marker patterns in combination with a new soft-decision decoder for a burst deletion channel that increases the rate compared to an approach based on non-binary de Bruijn sequences, with only a minor loss in performance of locating a deletion error.
References
More filters
Book
The Theory of Error-Correcting Codes
TL;DR: This book presents an introduction to BCH Codes and Finite Fields, and methods for Combining Codes, and discusses self-dual Codes and Invariant Theory, as well as nonlinear Codes, Hadamard Matrices, Designs and the Golay Code.
Book
Information Theory and Reliable Communication
TL;DR: This chapter discusses Coding for Discrete Sources, Techniques for Coding and Decoding, and Source Coding with a Fidelity Criterion.
Book
The Probabilistic Method
TL;DR: A particular set of problems - all dealing with “good” colorings of an underlying set of points relative to a given family of sets - is explored.