Skip to main navigation Skip to search Skip to main content

A linear programming based channel coding strong converse for the BSC and BEC

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

This paper illustrates the application of the linear programming (LP) based framework proposed by the authors previously [1] in deriving improved converses for finite blocklength channel coding of a discrete memoryless binary symmetric channel (BSC) and binary erasure channel (BEC). Employing elementary concepts of optimization, finite blocklength channel coding converses for BSC and BEC are derived from first principles. The converses thus derived do not rely on information theoretic constructs like tilted information or information densities. Moreover, it is shown that the converses obtained imply the strong converse for BSC and BEC, thereby introducing a new approach for explaining the strong converse phenomenon.
Original languageEnglish
Title of host publication2017 Twenty-third National Conference on Communications (NCC)
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
ISBN (Electronic)9781509053568
ISBN (Print)9781509053575
DOIs
Publication statusPublished - 23 Oct 2017
EventTwenty-third National Conference on Communications (NCC) - Chennai, India
Duration: 2 Mar 2017 → 4 Mar 2017

Publication series

NameNational Conference on Communications (NCC)
PublisherIEEE

Conference

ConferenceTwenty-third National Conference on Communications (NCC)
Country/TerritoryIndia
CityChennai
Period2/03/17 → 4/03/17

Fingerprint

Dive into the research topics of 'A linear programming based channel coding strong converse for the BSC and BEC'. Together they form a unique fingerprint.

Cite this