Binary codes for compound channels (Corresp.)
Philippe Piret · IEEE Transactions on Information Theory · 1985
The error correcting capabilities are studied of some binary codes used on channels where both independent and burst errors may occur. The compound distance profile is introduced, and a lower bound on this profile is obtained for a class of modified maximum distance separable codes. Several constructions are presented as an illustration.