We consider the minimum weight of codewords in a quasi-cyclic code and characterize the estimate in its most general setup using their concatenated structure. The new bound we derive generalizes the Jensen and Güneri–Özbudak bounds and it holds for the more general class of multilevel concatenated codes.

中文翻译：

---

准循环码的新距离界限

我们考虑准循环码中码字的最小权重，并使用其级联结构来表征其最一般设置中的估计。我们得出的新界限概括了 Jensen 和 Güneri-Özbudak 界限，并且它适用于更一般的多级级联码。