Channels with intermittent errors

Arya Mazumdar, Alexander Barg

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

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.

Original languageEnglish (US)
Title of host publication2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Pages1753-1757
Number of pages5
DOIs
StatePublished - Oct 26 2011
Event2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 - St. Petersburg, Russian Federation
Duration: Jul 31 2011Aug 5 2011

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8104

Other

Other2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
CountryRussian Federation
CitySt. Petersburg
Period7/31/118/5/11

Keywords

  • Non-adjacent errors
  • bounds on codes
  • channel capacity
  • linear codes
  • list decoding

Fingerprint Dive into the research topics of 'Channels with intermittent errors'. Together they form a unique fingerprint.

Cite this