Upper-bound conjecture for MaxEJS expected blocklength via a genie-aided decoder
Statement
The paper considers a binary symmetric channel with crossover probability , message size , and error tolerance . Let denote the channel capacity, let denote the relevant confirmation-phase constant, and let be the stopping time of variable-length coding with the MaxEJS scheme.
MaxEJS blocklength upper-bound conjecture. The expected blocklength satisfies
This conjecture formalizes the claim that the approximate expected blocklength obtained from the genie-aided decoder is an upper bound for the true MaxEJS scheme. The supplied text does not indicate whether the conjecture has been resolved.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.