ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GqG_q be an alphabet of size q≥2q\ge 2, let t≥1t\ge 1 be fixed, and let C⊆GqnC\subseteq G_q^n. For X,Y∈Gqt×nX,Y\in G_q^{t\times n}, define the column Hamming distance by dH(X,Y)=∣{j∈{1,…,n}:X∗,j≠Y∗,j}∣d_H(X,Y)=|\{j\in\{1,\ldots,n\}:X_{*,j}\ne Y_{*,j}\}|, and define the tt-th covering radius of CC by Rt(C)=max⁡X∈Gqt×nmin⁡Y∈CtdH(X,Y)R_t(C)=\max_{X\in G_q^{t\times n}}\min_{Y\in C^t}d_H(X,Y). Let κt(ρ,q)\kappa_t(\rho,q) be the infimum of lim inf⁡n→∞n−1log⁡q∣Cn∣\liminf_{n\to\infty}n^{-1}\log_q|C_n| over sequences Cn⊆GqnC_n\subseteq G_q^n satisfying Rt(Cn)≤ρnR_t(C_n)\le \rho n. Determine whether κt(ρ,q)={1−Hqt(ρ),0≤ρ<1−q−t,0,1−q−t≤ρ≤1,\kappa_t(\rho,q)=\begin{cases}1-H_{q^t}(\rho),&0\le \rho<1-q^{-t},\\0,&1-q^{-t}\le \rho\le 1,\end{cases} where HQ(ρ)=ρlog⁡Q(Q−1)−ρlog⁡Qρ−(1−ρ)log⁡Q(1−ρ)H_Q(\rho)=\rho\log_Q(Q-1)-\rho\log_Q\rho-(1-\rho)\log_Q(1-\rho). When qq is a prime power, determine whether the same formula holds when every CnC_n is required to be a linear code over Fq\mathbb F_q.

Record

Added
Links

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.