A single-letter upper bound on the feedback capacity of unifilar finite-state channels

Published

Conference Paper

© 2016 IEEE. A single-letter upper bound on the feedback capacity of a unifilar finite-state channel is derived. The upper bound is tight for all cases where the feedback capacity is known. Its efficiency is also demonstrated by direct application of the bound on the dicode erasure channel, which results in a new capacity result. The bound is based on a new technique, called the Q-contexts mapping, where the channel outputs are recursively quantized to a finite set, called the contexts set.

Full Text

Duke Authors

Cited Authors

  • Sabag, O; Permuter, HH; Pfister, HD

Published Date

  • August 10, 2016

Published In

Volume / Issue

  • 2016-August /

Start / End Page

  • 310 - 314

International Standard Serial Number (ISSN)

  • 2157-8095

International Standard Book Number 13 (ISBN-13)

  • 9781509018062

Digital Object Identifier (DOI)

  • 10.1109/ISIT.2016.7541311

Citation Source

  • Scopus