Related papers: Submodule codes as spherical codes in buildings
We describe a novel extension of subspace codes for noncoherent networks, suitable for use when the network is viewed as a communication system that introduces both dimension and symbol errors. We show that when symbol erasures occur in a…
Recently, many good quantum codes over various finite fields $F_q$ have been constructed from codes over extension rings or mixed alphabet rings via some version of a Gray map. We show that most of these codes can be obtained more directly…
We introduce a new concept of a semiprime submodule. We show that a submodule of a finitely generated module over a commutative ring is semiprime if and only if it is radical, that is, an intersection of prime submodules. Using our notion,…
We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…
A method for finding an optimum $n$-dimensional commutative group code of a given order $M$ is presented. The approach explores the structure of lattices related to these codes and provides a significant reduction in the number of…
Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. Here we collect the present knowledge on lower and upper bounds for binary subspace codes for…
The existence and construction of self-dual codes in a permutation module of a finite group for the semisimple case are described from two aspects, one is from the point of view of the composition factors which are self-dual modules, the…
Subsystem codes are a generalization of noiseless subsystems, decoherence free subspaces, and quantum error-correcting codes. We prove a Singleton bound for GF(q)-linear subsystem codes. It follows that no subsystem code over a prime field…
In this work, we study the structure of multivariable modular codes over finite chain rings when the ambient space is a principal ideal ring. We also provide some applications to additive modular codes over the finite field $\mathbb{F}_4$.
We describe and present a new construction method for codes using encodings from group rings. They consist primarily of two types: zero-divisor and unit-derived codes. Previous codes from group rings focused on ideals; for example cyclic…
In this paper cyclic codes are established with respect to the Mannheim metric over some finite rings by using Gaussian integers and the decoding algorithm for these codes is given.
In this work, we study cyclic codes that have generators as Fibonacci polynomials over finite fields. We show that these cyclic codes in most cases produce families of maximum distance separable and optimal codes with interesting…
We apply the theory of Bruhat-Tits trees to the study of optimal embeddings of two and three dimensional commutative orders into quaternion algebras. Specifically, we determine how many conjugacy classes of global Eichler orders in a…
In this note, an intrinsic description of some families of linear codes with symmetries is given, showing that they can be described more generally as quasi group codes, that is, as linear codes allowing a group of permutation automorphisms…
This paper provides an overview of the theory of Bruhat-Tits buildings. Besides, we explain how Bruhat-Tits buildings can be realized inside Berkovich spaces. In this way, Berkovich analytic geometry canbe used to compactify buildings. We…
We study two subcategories of the category of artinian modules, a wide subcategory and a Serre subcategory. We prove that all wide subcategories of artinian modules are Serre subcategories. We also provide the bijection between the set of…
We generalize staircase codes and tiled diagonal zipper codes, preserving their key properties while allowing each coded symbol to be protected by arbitrarily many component codewords rather than only two. This generalization which we term…
Let $f:\hat{C}\to\hat{C}$ be a subhyperbolic rational map of degree $d$. We construct a set of coding maps $Cod(f)=\{\pi_r:\Sigma\to J\}_r$ of the Julia set $J$ by geometric coding trees, where the parameter $r$ ranges over mappings from a…
Generalizing supertropical algebras, we present a "layered" structure, "sorted" by a semiring which permits varying ghost layers, and indicate how it is more amenable than the "standard" supertropical construction in factorizations of…
A subspace of a finite extension field is called a Sidon space if the product of any two of its elements is unique up to a scalar multiplier from the base field. Sidon spaces were recently introduced by Bachoc et al. as a means to…