Meny

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

Asymptotic distance properties of binary woven convolutional codes

Författare:
Publiceringsår: 1999
Språk: Engelska
Sidor: 311-326
Publikation/Tidskrift/Serie: Problems of Information Transmission
Volym: 35
Nummer: 4
Dokumenttyp: Artikel

Sammanfattning

Two constructions of binary concatenated convolutional codes are considered. In our previous work [Proc. 4th Int. Symp. Commun. Theory Appl., Lake District, UK (1997)] such codes were called woven convolutional codes. In the present paper, asymptotic lower bounds on active distances of woven convolutional codes are investigated. It is shown that these distances can be bounded from below by linearly growing functions with a strictly positive slope for all rates of concatenated codes, and the construction complexity of woven convolutional codes grows as an exponent of the memory of these codes.

Disputation

Nyckelord

  • Technology and Engineering

Övriga

Published
Yes
  • 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