Submodule codes as spherical codes in buildings

Abstract

We give a generalization of subspace codes by means of codes of modules over finite commutative chain rings. We define a new class of Sperner codes and use results from extremal combinatorics to prove the optimality of such codes in different cases. Moreover, we explain the connection with Bruhat-Tits buildings and show how our codes are the buildings' analogue of spherical codes in the Euclidean sense.

21 pages, revision including the referees' suggestions, to appear in Designs, Codes and Cryptography

References in corpus (7)

• Duality and separation theorems in idempotent semimodules
• Towards a theory of non-commutative optimization: geodesic first and second order methods for moment maps and polytopes
• Bounds for flag codes
• Orders and Polytropes: Matrix Algebras from Valuations
• The Gaussian entropy map in valued fields
• The Buildings Gallery: visualising buildings
• Bolytrope orders