On linear k-graphs with codegree Tur\'an density arbitrarily close to zero

Let $F$ be a $k$-uniform hypergraph, abbreviated as $k$-graph. The codegree Tur\'an density $\pi_{\mathrm{co}}(F)$ is the supremum over all $\gamma \in [0,1)$ such that, for arbitrarily large $n$, there exists an $n$-vertex $F$-free $k$-graph $H$ whose every $(k-1)$-subset of vertices lies in at least $\gamma n$ edges. In this paper, we prove that there is a linear $k$-graph $F$ with $0<\pi_{co}(F) < \varepsilon$ for any $\varepsilon>0$. The special case $k=3$ solve a question proposed by Ding, Lamaison, Liu, Wang and Yang (JLMS, 2025). The main method combines an affine-plane-type incidence structure over a finite field and elementary number-theoretic arguments.