A construction of codes with exponential error bounds on arbitrary discrete memoryless channels

This correspondence proposes an explicit construction of codes achieving capacity for arbitrary discrete memoryless channels. The proposed code is obtained by concatenating variable inner codes and an algebraic geometry code. Further, we clarify that the proposed code achieves the error exponent obtained by Forney for concatenated codes.