$r$-Minimal Poset Codes

In this paper, we propose and study $r$-minimal codes with respect to $\mathbf{P}$-support, where $\mathbf{P}=(\Omega,\preccurlyeq_{\mathbf{P}})$ is a poset defined on the coordinate set of the ambient space $\mathbf{H}$. $r$-Minimal $\mathbf{P}$-codes are natural extensions of Hamming metric minimal codes that have been extensively studied in the literature.

We characterize $r$-minimal $\mathbf{P}$-codes in terms of the notion so called cutting $r$-blocking maps, which generalizes the well-known equivalence between minimal Hamming metric codes and cutting blocking sets.

We also give a necessary and sufficient condition for $r$-minimality in terms of $(\mathbf{P},\omega)$-weight defined on $\mathbf{H}$, where $\omega:\Omega\longrightarrow\mathbb{R}^{+}$ is an arbitrary weight function.

This leads to a generalization of the well-known Ashikhmin-Barg criterion for Hamming metric minimal codes.

We then prove two existence results for $r$-minimal $\mathbf{P}$-codes, both for general $\mathbf{P}$ and for the special case that $\mathbf{P}$ is a disjoint union of chains.

When $\mathbf{P}$ is hierarchical, we characterize $r$-minimal $\mathbf{P}$-codes in terms of $r$-minimal Hamming metric codes.

Finally, we characterize cutting $r$-blocking sets induced by hierarchical posets with two levels, which further enables us to answer a question raised in Hyun, Kim, Wu and Yue \cite{28}.