ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let s1,s2,…s_1,s_2,\ldots be the source packets, let V[n]V[n] be the transmit index in slot nn, and suppose that a transmission with index V[n]V[n] 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 s1s_1 through sV[n]s_{V[n]}. Full-rank coding conjecture. Given transmit index V[n]V[n], there is no loss of generality in including all packets s1s_1 to sV[n]s_{V[n]}. 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.