On the error-correction capabilities of some GC and binary cyclic UEP codes

For some special generalized concatenated (GC) codes new bounds on the minimum distance are derived which are tighter than the known bounds. Furthermore, these new bounds are applied to the equivalent binary cyclic codes for estimating the true minimum distance and the unequal error protection (UEP) capabilities. The author shows that for many codes the new bounds give the true minimum distance and the maximal UEP capabilities.<
>