New distance bounds for quasi-cyclic codes
摘要
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.