Encoder and Distance Properties of Woven Convolutional Codes with One Tailbiting Component Code
Problems of Information Transmission
Distance Approach to Window Decoding
Problems of Information Transmission
A Distance Measure Tailored to Tailbiting Codes
Problems of Information Transmission
A MacWilliams identity for convolutional codes: the general case
IEEE Transactions on Information Theory
Double serially concatenated convolutional codes with jointly designed S-type permutors
IEEE Transactions on Information Theory
A rate R = 5/20 hypergraph-based woven convolutional code with free distance 120
IEEE Transactions on Information Theory
Woven graph codes: asymptotic performances and examples
IEEE Transactions on Information Theory
Woven convolutional graph codes with large free distances
Problems of Information Transmission
| Hi-index | 755.08 |
Encoders for convolutional codes with large free distances can be constructed by combining several less powerful convolutional encoders. This paper is devoted to constructions in which the constituent convolutional codes are woven together in a manner that resembles the structure of a fabric. The general construction is called twill and it is described together with two special cases, viz., woven convolutional encoders with outer warp and with inner warp. The woven convolutional encoders inherit many of their structural properties, such as minimality and catastrophicity, from their constituent encoders. For all three types of woven convolutional codes upper and lower bounds on their free distances as well as lower bounds on the active distances of their encoders are derived