2000 character limit reached
On the Reliability Function for a BSC with Noiseless Feedback at Zero Rate (2210.06751v1)
Published 13 Oct 2022 in cs.IT and math.IT
Abstract: We consider the transmission of nonexponentially many messages through a binary symmetric channel with noiseless feedback. We obtain an upper bound for the best decoding error exponent. Combined with the corresponding known lower bound, this allows to find the reliability function for this channel at zero rate.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.