Talk by Dr. Henry Chimal-Dzul
Date: 01.06.22 Time: 15.00 - 16.00 Room:
Quasi-cyclic (QC) linear codes over finite fields constitute an important class of linear block codes. They are a remarkable generalization of cyclic codes and, in contrast to them, several QC codes attain the highest minimum Hamming distance possible for a given length and dimension. In this talk we review basic aspects of QC codes and three perspectives of their algebraic structure. Some preliminary results on generator and parity check matrices for these codes over extension fields will be also presented.
(**This eSeminar will take place online on Zoom, using the same meeting details as previous seminars. If you do not have meeting details, please contact firstname.lastname@example.org **)