Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

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

Författare

Summary, in English

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

Publiceringsår

1996

Språk

Engelska

Sidor

548-551

Publikation/Tidskrift/Serie

[Host publication title missing]

Volym

1

Dokumenttyp

Konferensbidrag

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Conference name

International Conference on Communication Technology , ICCT'96

Conference date

1996-05-05 - 1996-05-07

Conference place

Beijing, China

Status

Published

ISBN/ISSN/Övrigt

  • ISBN: 0-7803-2916-3