Sökning: id:"swepub:oai:lup.lub.lu.se:858422ab-a8a1-452e-9591-1af3077004c4" >
Asymptotic distance...
Asymptotic distance properties of binary woven convolutional codes
-
Zyablov, Viktor V. (författare)
-
Skopinsev, Oleg D. (författare)
-
- Höst, Stefan (författare)
- Lund 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
-
visa fler...
-
- Johannesson, Rolf (författare)
- Lund 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
-
visa färre...
-
(creator_code:org_t)
- 1999
- 1999
- Engelska.
-
Ingår i: Problems of Information Transmission. - 0032-9460. ; 35:4, s. 311-326
- Relaterad länk:
-
https://lup.lub.lu.s...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering (hsv//eng)
Publikations- och innehållstyp
- art (ämneskategori)
- ref (ämneskategori)
Hitta via bibliotek
Till lärosätets databas