English

Recursive Structure of Hulls of PRM Codes

Information Theory 2026-04-24 v1 math.IT

Abstract

For a nonnegative integer rr and a positive integer vv satisfying r(q1)2<v<(r+1)(q1)2, \frac{r(q-1)}{2}<v<\frac{(r+1)(q-1)}{2}, we define the combinatorial numbers Ar(v)={t=r(q1)vv j=0r(1)j(rj)(tjq+r1r1),r>0,1,r=0. A_r(v)= \begin{cases} \displaystyle \sum_{t=r(q-1)-v}^{v}\ \sum_{j=0}^{r}(-1)^j\binom{r}{j}\binom{t-jq+r-1}{r-1}, & r>0,\\[1.2ex] 1, & r=0. \end{cases} For the projective Reed-Muller code \PRM(q,m,v)\PRM(q,m,v), we determine its hull dimension: dim\Hull(\PRM(q,m,v))=dim\PRM(q,m,v)i=0A2i+ϵ(v(i)(q1)), \dim \Hull\bigl(\PRM(q,m,v)\bigr) = \dim \PRM(q,m,v) - \sum_{i=0}^{\ell}A_{2i+\epsilon}\bigl(v-(\ell-i)(q-1)\bigr), where =r2,ϵ={0,r is even,1,r is odd. \ell=\Bigl\lfloor\frac r2\Bigr\rfloor,\qquad \epsilon= \begin{cases} 0, & r\ \text{is even}, 1, & r\ \text{is odd}. \end{cases} This formula applies in the open lower-half range 0<v<m\Qm2, 0<v<\frac{m\Qm}{2}, equivalently for vIrv\in I_r with mr+1m\ge r+1; the range m\Qm2<v<m\Qm \frac{m\Qm}{2}<v<m\Qm is then obtained by S\o rensen's duality theorem \cite{Sorensen}.

Cite

@article{arxiv.2604.21808,
  title  = {Recursive Structure of Hulls of PRM Codes},
  author = {Yufeng Song and Qin Yue},
  journal= {arXiv preprint arXiv:2604.21808},
  year   = {2026}
}

Comments

25 pages

R2 v1 2026-07-01T12:32:42.993Z