A generalization of the Reiger bound is presented for the list decoding of burst errors. It is then shown that Reed-Solomon codes attain this bound.
生成讲解博客的中文版本
生成AI智能校验的中文版本