Linear codes using simplicial complexes

Abstract: Certain simplicial complexes are used to construct a subset $D$ of $\mathbb{F}{2^n}^m$ and $D$, in turn, defines the linear code $C{D}$ over $\mathbb{F}{2^n}$ that consists of $(v\cdot d){d\in D}$ for $v\in \mathbb{F}{2^n}^m$. Here we deal with the case $n=3$, that is, when $C{D}$ is an octanary code. We establish a relation between $C_{D}$ and its binary subfield code $C_{D}^{(2)}$ with the help of a generator matrix. For a given length and dimension, a code is called distance optimal if it has the highest possible distance. With respect to the Griesmer bound, five infinite families of distance optimal codes are obtained, and sufficient conditions for certain linear codes to be minimal are established.