Correcting a Single Error in an Asymmetric Feedback Channel
摘要
We prove a new lower bound on the size of a code with complete feedback correcting a single error in a binary asymmetric channel. We also present an upper bound on the size of the code, which is close to the new lower bound.