Asymptotic distance properties of binary woven convolutional codes
From MaRDI portal
The authors describe two construction algorithms for convolutional codes; they define and investigate active distance properties of so-called woven convolutional codes. Using polynomial generator matrices and assuming that memories of both outer and inner codes grow infinitely, they analyze the asymptotic lower bound on active distances. They also investigate the construction complexity of woven convolutional codes and show that this complexity grows exponentially with the growth of code memory.
Recommendations
- Woven convolutional codes .I. Encoder properties
- scientific article; zbMATH DE number 2154124
- Woven convolutional graph codes with large free distances
- Encoder and distance properties of woven convolutional codes with one tailbiting component code
- On the error exponent for woven convolutional codes with outer warp
Cited in
(8)- On the performance of block woven codes constructions with row-wise permutations
- Encoder and distance properties of woven convolutional codes with one tailbiting component code
- Woven Convolutional Codes II: Decoding Aspects
- On Nested Convolutional Codes and Their Application to Woven Codes
- Woven convolutional codes .I. Encoder properties
- scientific article; zbMATH DE number 2154121 (Why is no real title available?)
- scientific article; zbMATH DE number 2154124 (Why is no real title available?)
- Woven convolutional graph codes with large free distances
This page was built for publication: Asymptotic distance properties of binary woven convolutional codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569278)
