Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

On the theory of list decoding of convolutional codes

Towards a theory for list decoding of convolutional codes
Publiceringsår: 1996
Språk: Engelska
Sidor: 104-111
Publikation/Tidskrift/Serie: Problems of Information Transmission
Volym: 32
Nummer: 1
Dokumenttyp: Artikel


Lower bounds on the list minimum weight and list weight are obtained for ensembles of systematic and nonsystematic encoders. >From these bounds it follows that the necessary list size grows exponentially with the number of corrected errors. We obtain an expurgated upper bound on the probability of the correct path loss for the ensemble of time-invariant binary convolutional codes. The notion of an l-list weight enumerator is introduced and used to obtain an upper bound on the probability of the correct path loss for list decoding of a fixed convolutional code.



  • Electrical Engineering, Electronic Engineering, Information Engineering


  • ISSN: 0032-9460

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