Concentration conjecture for the verification decoder's edge-type counts
Statement
Let denote the discrete decoding time, let be the number of edges connected to IVNs of type , and let , where is the history up to time . Let be the lifespan of the random process and let be the maximum variable-node degree. Concentration conjecture.
for all . This concentration is one of the unproved assumptions needed to establish the correctness of the decoding analysis.
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.