ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let N(n,3,t)N(n,3,t) denote the sequence reconstruction number for length-nn sequences over a binary deletion channel with three deletions and trace length parameter tt, and let D(n,t)D(n,t) denote the associated quantity used in the paper. Proposed reconstruction formula. For any t≥5t\geq 5 and n≥13n\geq 13, we have

N(n,3,t)=6D(n−6,t−3)+4D(n−8,t−3)+6D(n−9,t−3)+4D(n−11,t−3)+2D(n−13,t−5)+D(n−13,t−6).N(n,3,t)=6D(n-6,t-3)+4D(n-8,t-3)+6D(n-9,t-3)+4D(n-11,t-3)+2D(n-13,t-5)+D(n-13,t-6).

This formula is presented as the paper's conjectured extension of its lower-bound results for N(n,3,t)N(n,3,t); the supplied text does not indicate whether it has been proved or disproved.

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.