Generalization of the Fano and Non-Fano Index Coding Instances

Matroid theory is fundamentally connected with index coding and network coding problems. In fact, the reliance of linear index coding and network coding rates on the characteristic of a field has been demonstrated by using the two well-known matroid instances, namely the Fano and non-Fano matroids. This established the insufficiency of linear coding, one of the fundamental theorems in both index coding and network coding. While the Fano matroid is linearly representable only over fields with characteristic two, the non-Fano instance is linearly representable only over fields with odd characteristic. For fields with arbitrary characteristic $p$, the Fano and non-Fano matroids were extended to new classes of matroid instances whose linear representations are dependent on fields with characteristic $p$. However, these matroids have not been well appreciated nor cited in the fields of network coding and index coding. In this paper, we first reintroduce these matroids in a more structured way. Then, we provide a completely independent alternative proof with the main advantage of using only matrix manipulation rather than complex concepts in number theory and matroid theory. In this new proof, it is shown that while the class $p$-Fano matroid instances are linearly representable only over fields with characteristic $p$, the class $p$-non-Fano instances are representable over fields with any characteristic other than characteristic $p$. Finally, following the properties of the class $p$-Fano and $p$-non-Fano matroid instances, we characterize two new classes of index coding instances, respectively, referred to as the class $p$-Fano and $p$-non-Fano index coding, each with a size of $p^2 + 4p + 3$.
Comment: arXiv admin note: text overlap with arXiv:2201.10057