Related papers: Submodule codes as spherical codes in buildings
Permutation codes are a class of structured vector quantizers with a computationally-simple encoding procedure based on sorting the scalar components. Using a codebook comprising several permutation codes as subcodes preserves the…
Given a split semisimple group over a local field, we consider the maximal Satake-Berkovich compactification of the corresponding Euclidean building. We prove that it can be equivariantly identified with the compactification which we get by…
Let $G$ be the group of rational points of a split connected reductive group over a nonarchimedean local field of residue characteristic $p$. Let $I$ be a pro-$p$ Iwahori subgroup of $G$ and let $R$ be a commutative quasi-Frobenius ring. If…
We introduce a class of codes with overlapping code words, that we call SPO-codes. The SPO-codes are related to the Markov codes that were introduced in: G. Keller, J. Combinatorial Theory 56, (1991),pp.\ 75--83. The process of generating a…
In this paper, we will study some connections between Hilbert al- gebras and binary block-codes.With these codes, we can eassy obtain orders which determine suplimentary properties on these algebras. We will try to emphasize how, using…
We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the obtained codes share most properties of cyclic codes. Since…
Let $R$ be a commutative ring. A full additive subcategory $\C$ of $R$-modules is triangulated if whenever two terms of a short exact sequence belong to $\C$, then so does the third term. In this note we give a classification of…
A super-modular category is a unitary pre-modular category with M\"uger center equivalent to the symmetric unitary category of super-vector spaces. Super-modular categories are important alternatives to modular categories as any unitary…
We present a new application of multi-orbit cyclic subspace codes to construct large optical orthogonal codes, with the aid of the multiplicative structure of finite fields extensions. This approach is different from earlier approaches…
The structure of multivariate semisimple codes over a finite chain ring $R$ is established using the structure of the residue field $\bar R$. Multivariate codes extend in a natural way the univariate cyclic and negacyclic codes and include…
We consider generalizations of Reed-Muller codes, toric codes, and codes from certain plane curves, such as those defined by norm and trace functions on finite fields. In each case we are interested in codes defined by evaluating arbitrary…
We construct local and global moduli spaces of supersymmetric curves with Ramond-Ramond punctures. We assume that the underlying ordinary algebraic curves have a level n structure and build these supermoduli spaces as algebraic superspaces,…
In this paper we study the structure of $\theta$-cyclic codes over the ring $B_k$ including its connection to quasi-$\tilde{\theta}$-cyclic codes over finite field $\mathbb{F}_{p^r}$ and skew polynomial rings over $B_k.$ We also…
Separating codes have their applications in collusion-secure fingerprinting for generic digital data, while they are also related to the other structures including hash family, intersection code and group testing. In this paper we study…
In the field of mathematics, a purely combinatorial equivalent to a simplicial complex, or more generally, a down-set, is an abstract structure known as a family of sets. This family is closed under the operation of taking subsets, meaning…
A classical problem in the literature seeks the minimal number of proper subgroups whose union is a given finite group. A different question, with applications to error-correcting codes and graph colorings, involves covering vector spaces…
We survey some methods developed in a series of papers, for classifying localising subcategories of tensor triangulated categories. We illustrate these methods by proving a new theorem, providing such a classification in the case of the…
Construction of subspace codes with good parameters is one of the most important problems in random network coding. In this paper we present first a generalization of the concept of cyclic subspaces codes and further we show that the usual…
We count the number of submodules of an arbitrary module over a countable noetherian commutative ring. We give, along the way, a structural description of meager modules, which are defined as those that do not have the square of a simple…
We present a structure associated to the class of linear codes. The properties of that structure are similar to some structures in the linear algebra techniques into the framework of the Gr\"obner bases tools. It allows to get some insight…