A generalization of the BCH bound to the case of quasi-cyclic codes is proposed. The new approach is based on eigenvalues of matrix polynomials. This results in improved minimum distance estimates compared to the existing bounds.
No takes yet. Share an insight, caveat, or question.
Semenov et al. (2012) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: