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.

Asymptotic distance properties of binary woven convolutional codes

In English

Författare

Summary, in English

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.

Publiceringsår

1999

Språk

Engelska

Sidor

311-326

Publikation/Tidskrift/Serie

Problems of Information Transmission

Volym

35

Issue

4

Dokumenttyp

Artikel i tidskrift

Förlag

Springer

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Status

Published

ISBN/ISSN/Övrigt

  • ISSN: 0032-9460