Asymptotic distance properties of binary woven convolutional codes

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.

Skopinsev, Oleg D. (author)
Höst, StefanLund University,Lunds universitet,Institutionen för elektro- och informationsteknik,Institutioner vid LTH,Lunds Tekniska Högskola,Department of Electrical and Information Technology,Departments at LTH,Faculty of Engineering, LTH(Swepub:lu)it-sho (author)
Johannesson, RolfLund University,Lunds universitet,Institutionen för elektro- och informationsteknik,Institutioner vid LTH,Lunds Tekniska Högskola,Department of Electrical and Information Technology,Departments at LTH,Faculty of Engineering, LTH(Swepub:lu)it-rjo (author)
Institutionen för elektro- och informationsteknikInstitutioner vid LTH (creator_code:org_t)

By the author/editor: Zyablov, Viktor ...; Skopinsev, Oleg ...; Höst, Stefan; Johannesson, Rol ...

About the subject

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.