Bounds on Distances for Unit Memory Concatenated Codes

Two schemes of concatenated coding on the basis of outer unit memory code are considered. Constructive lower bounds for free distance, also for extended row, column, and segment distances are obtained. It is proved that in the random ensemble of unit memory concatenated codes there exist codes that asymptotically meet the best known bounds on distances for unit memory codes.