Correcting errors in asymmetric and generalized asymmetric channels with feedback

We study generalized asymmetric channel with noiseless instantaneous feedback and present a q-ary code of length n that transmits q
^n−t
messages and corrects t errors for t ≤ n ≤ q +t−1. For the binary asymmetric channel, we present a new algorithm for constructing optimal codes with complete feedback, correcting a single error.