Du är här

An expurgation upper bound on the probability of corret path loss for time-invariant convolutional codes

Publiceringsår: 1996
Språk: Engelska
Sidor: 548-551
Volym: 1
Dokumenttyp: Konferensbidrag

Sammanfattning

In this paper list decoding of convolutional codes is considered. List decoding is a very powerful, low complexity, non-backtracking decoding method that does not fully exploit the error correcting capability of the code. A correct path loss is a serious kind of error event that is typical for list decoding. An expurgated upper bound on the probability of correct path loss is derived for the ensembles of systematic and nonsystematic time-varying convolutional codes

Disputation

Nyckelord

  • Technology and Engineering

Övrigt

International Conference on Communication Technology , ICCT'96
1996-05-05/1996-05-07
Beijing, China
Published
Yes
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder."
  • ISBN: 0-7803-2916-3

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen

LERU logo U21 logo