אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב

In this seminar talk, we introduce linear quasi-cyclic codes over finite fields. We recall the spectral analysis of Semenov-Trifonov (ST) and explain their BCH-like lower bound on the minimum distance of quasi-cyclic codes. Furthermore, we propose a new bound that generalizes the ST approach and give a syndrome-based algebraic decoding algorithm up to the new bound.

Joint work with San Ling.