Probability estimates for random linear systems over finite fields and convolutional codes
Talk by Prof. Dr. Julia Lieb
Date: 09.11.16 Time: 16.00 - 17.00 Room: Y27H12
It is known that convolutional codes could be described by linear systems over finite fields. Moreover, some desirable properties of linear systems, such as reachability and observability, can be used to characterize if a convolutional code is non-catastrophic. This is also possible if one considers networks of linear systems and correspondingly, interconnected convolutional codes. In this talk, probability estimates for concatenations of random linear systems and convolutional codes are given. Furthermore, we compare the results for two different probability measures, namly the uniform probability distribution and the so-called natural density. Finally, we will look at series connections of block and convolutional codes and estimate the probability of having maximum distance profile.