On Reed-Muller-Type Codes Associated to Proto-Exact Categories

Source abstract

In this paper, we show how to associate a family of binary linear block codes to the class of admissibly cofinitary objects in any proto-exact category with rank function. This family naturally generalizes the well-studied family of binary Reed-Muller codes, and recovers this classical family for suitable choices of category. We also expand the list of known examples of proto-abelian categories to include incidence categories of posets. As an application of this result, we construct a binormal, combinatorial, proto-abelian category of Kashiwara crystals associated to any root system. In the case that the proto-exact category is a category of $\mathbb{F}_1$-representations of quivers, we show how to reconstruct our family via the language of algebraic geometry codes, in particular motivating an extension to arbitrary finite fields. We provide explicit computations of the dimension and minimum distance for select families of $\mathbb{F}_1$-representations of quivers.