An improved bound on the list error probability and list distance properties

Irina Bocharova; Boris Kudryashov; Rolf Johannesson; Maja Loncar

doi:10.1109/ISIT.2006.261626

An improved bound on the list error probability and list distance properties

Irina Bocharova, Boris Kudryashov, Rolf Johannesson, Maja Loncar

Department of Electrical and Information Technology

Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review

Abstract

A new upper bound on the list error probability is presented. This bound is derived by combining the techniques for obtaining the tangential union bound with an improved bound on the error probability with respect to a given list. Connections between the list distance and the eigenvalues of the covariance matrix of the code are studied

Original language	English
Title of host publication	2006 IEEE International Symposium on Information Theory
Pages	719-723
DOIs	https://doi.org/10.1109/ISIT.2006.261626
Publication status	Published - 2006
Event	IEEE International Symposium on Information Theory, 2006 - Seattle, Seattle, WA, United States Duration: 2006 Jul 9 → 2006 Jul 14

Conference

Conference	IEEE International Symposium on Information Theory, 2006
Abbreviated title	ISIT06
Country/Territory	United States
City	Seattle, WA
Period	2006/07/09 → 2006/07/14

Subject classification (UKÄ)

Electrical Engineering, Electronic Engineering, Information Engineering

Free keywords

decoding
covariance matrices
eigenvalues and eigenfunctions
error statistics

Access to Document

10.1109/ISIT.2006.261626

Cite this

@inproceedings{30b63e75ddc74a06a71dfbe4a2e216db,

title = "An improved bound on the list error probability and list distance properties",

abstract = "A new upper bound on the list error probability is presented. This bound is derived by combining the techniques for obtaining the tangential union bound with an improved bound on the error probability with respect to a given list. Connections between the list distance and the eigenvalues of the covariance matrix of the code are studied",

keywords = "decoding, covariance matrices, eigenvalues and eigenfunctions, error statistics",

author = "Irina Bocharova and Boris Kudryashov and Rolf Johannesson and Maja Loncar",

year = "2006",

doi = "10.1109/ISIT.2006.261626",

language = "English",

isbn = "1 4244 0504 1",

pages = "719--723",

booktitle = "2006 IEEE International Symposium on Information Theory",

note = "IEEE International Symposium on Information Theory, 2006, ISIT06 ; Conference date: 09-07-2006 Through 14-07-2006",

}

TY - GEN

T1 - An improved bound on the list error probability and list distance properties

AU - Bocharova, Irina

AU - Kudryashov, Boris

AU - Johannesson, Rolf

AU - Loncar, Maja

PY - 2006

Y1 - 2006

N2 - A new upper bound on the list error probability is presented. This bound is derived by combining the techniques for obtaining the tangential union bound with an improved bound on the error probability with respect to a given list. Connections between the list distance and the eigenvalues of the covariance matrix of the code are studied

AB - A new upper bound on the list error probability is presented. This bound is derived by combining the techniques for obtaining the tangential union bound with an improved bound on the error probability with respect to a given list. Connections between the list distance and the eigenvalues of the covariance matrix of the code are studied

KW - decoding

KW - covariance matrices

KW - eigenvalues and eigenfunctions

KW - error statistics

U2 - 10.1109/ISIT.2006.261626

DO - 10.1109/ISIT.2006.261626

M3 - Paper in conference proceeding

SN - 1 4244 0504 1

SP - 719

EP - 723

BT - 2006 IEEE International Symposium on Information Theory

T2 - IEEE International Symposium on Information Theory, 2006

Y2 - 9 July 2006 through 14 July 2006

ER -

An improved bound on the list error probability and list distance properties

Abstract

Conference

Subject classification (UKÄ)

Free keywords

Access to Document

Fingerprint

Cite this