ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix an integer q≥2q\ge 2. A qq-ary code of length nn and distance dd is a subset of [q]n[q]^n whose elements are pairwise separated by Hamming distance at least dd, and let Aq(n,d)A_q(n,d) denote the maximum size of such a code. Strong enumeration conjecture for q-ary codes. For every fixed c>0c>0, the number of qq-ary codes of length nn and distance dd is

2O(Aq(n,d))2^{O(A_q(n,d))}

whenever

d<(1−q−1−c)n.d<(1-q^{-1}-c)n.

The conjecture would give a substantially stronger enumeration bound than the paper's proved results. Its main obstacle is the apparent lack of strong supersaturation estimates showing that sets much larger than Aq(n,d)A_q(n,d) contain many pairs at distance at most dd; the source presents it as likely quite difficult and gives no resolution.

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.