Abstract
AbstractWe 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.
Funder
Deutsche Forschungsgemeinschaft
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications
Reference45 articles.
1. Abramenko P., Brown K.S.: Buildings: Theory and Applications, vol. 248. Graduate Texts in Mathematics. Springer, New York (2008).
2. Abramenko P., Nebe G.: Lattice chain models for affine buildings of classical type. Math. Ann. 322(3), 537–562 (2002).
3. Alabiad S., Alkhamees Y.: On classification of finite commutative chain rings. AIMS Math. 7(2), 1742–1757 (2022).
4. Alonso-González C., Navarro-Pérez M.A.: Cyclic orbit flag codes. Des. Codes Cryptogr. 89(10), 2331–2356 (2021).
5. Alonso-González C., Navarro-Pérez M.A., Soler-Escrivà X.: Flag codes from planar spreads in network coding. Finite Fields Appl. 68(101745), 20 (2020).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Maximum flag-rank distance codes;Journal of Combinatorial Theory, Series A;2024-10