The time-invariant time-sharing conjecture for streaming codes
Statement
Let be the block-wise feedback delay. A time-invariant scheme is specified by a vector of non-negative integers satisfying
and transmits linear combinations of the lowest-index unseen packets in each block. A time-sharing policy is a policy that alternates among such time-invariant schemes. Time-invariant time-sharing conjecture. For any coding scheme, there exists a corresponding time-sharing policy between time-invariant schemes that gives the same or strictly better trade-off. This conjecture would reduce the analysis of general block-wise feedback schemes to time-sharing among the defined time-invariant schemes; whether every coding scheme admits such a policy is not established in the supplied text.
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.