Asymptotically Tight Bounds for Generalized Covering Radii of Binary Primitive BCH Codes at All Higher Orders

Zeev Vladimir Belinsky, Aryeh Lev Zabokritskiy

We study how few parity-check columns are needed to span several prescribed syndromes of a binary primitive BCH code of length $2^m-1$, where $m$ is the extension degree. For the f…