The full-rank coding conjecture for in-order streaming
Statement
Let be the source packets, let be the transmit index in slot , and suppose that a transmission with index is a linear combination of source packets. Since packets must be decoded in order, the relevant class of transmissions consists of combinations of the packets through . Full-rank coding conjecture. Given transmit index , there is no loss of generality in including all packets to . This would justify restricting attention to full-rank codes, in which each transmission combines all packets up to its transmit index; the source presents this as a belief rather than an established result, and its effect on the achievable throughput–delay trade-off remains to be verified.
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.