The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

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

Author

Summary, in English

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

Publishing year

2006

Language

English

Pages

719-723

Publication/Series

2006 IEEE International Symposium on Information Theory

Document type

Conference paper

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • decoding
  • covariance matrices
  • eigenvalues and eigenfunctions
  • error statistics

Conference name

IEEE International Symposium on Information Theory, 2006

Conference date

2006-07-09 - 2006-07-14

Conference place

Seattle, WA, United States

Status

Published

ISBN/ISSN/Other

  • ISBN: 1 4244 0504 1