The error exponent of random gilbert-varshamov codes

Anelia Somekh-Baruch, Jonathan Scarlett, Albert Guillen I Fabregas

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We consider transmission over a discrete memoryless channel (DMC) W(y\x) with finite alphabets X and Y. It is assumed that an (n, Mn)-codebook Mn = [x1,..., xMn} with rate Rn = 1/n log Mn is used for transmission. The type-dependent maximum-metric decoder estimates the transmitted message as m = arg maxxiMn q(Pxi, y), (1) where xy is the joint empirical distribution [1, Ch. 2] of the pair (x, y) and the metric q : P(X × Y) → R is continuous. Maximum-likelihood (ML) decoding is a special case of (1), but the decoder may in general be mismatched [2], [3].

Original languageEnglish
Title of host publication2018 52nd Annual Conference on Information Sciences and Systems, CISS 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1-2
Number of pages2
ISBN (Electronic)9781538605790
DOIs
StatePublished - 21 May 2018
Event52nd Annual Conference on Information Sciences and Systems, CISS 2018 - Princeton, United States
Duration: 21 Mar 201823 Mar 2018

Publication series

Name2018 52nd Annual Conference on Information Sciences and Systems, CISS 2018

Conference

Conference52nd Annual Conference on Information Sciences and Systems, CISS 2018
Country/TerritoryUnited States
CityPrinceton
Period21/03/1823/03/18

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Computer Networks and Communications
  • Information Systems

Fingerprint

Dive into the research topics of 'The error exponent of random gilbert-varshamov codes'. Together they form a unique fingerprint.

Cite this