Related papers: On the Dimension of AG Trace Codes
We propose reducible algebraic curves as a mechanism to construct Partial MDS (PMDS) codes geometrically. We obtain new general existence results, new explicit constructions and improved estimates on the smallest field sizes over which such…
We find the connection between 3-dimensional commutative algebras with a trivial trace and plane quartics and its bitangents.
We provide bounds on the size of polynomial differential equations obtained by executing closure properties for D-algebraic functions. While it is easy to obtain bounds on the order of these equations, it requires some more work to derive…
We demonstrate $k+1$-term arithmetic progressions in certain subsets of the real line whose "higher-order Fourier dimension" is sufficiently close to 1. This Fourier dimension, introduced in previous work, is a higher-order (in the sense of…
A basic problem in constant dimension subspace coding is to determine the maximal possible size ${\bf A}_q(n,d,k)$ of a set of $k$-dimensional subspaces in ${\bf F}_q^n$ such that the subspace distance satisfies…
This paper introduces new constructions of sum-rank metric codes derived from algebraic function fields, as existing results on such codes remain limited. A major challenge lies in the determination of their parameters. We address this…
Quantitative recurrence indicators are defined by measuring the first entrance time of the orbit of a point $x$ in a decreasing sequence of neighborhoods of another point $y$. It is proved that these recurrence indicators are a.e. greater…
Flag codes generalize constant dimension codes by considering sequences of nested subspaces with prescribed dimensions as codewords. A comprehensive construction, which unites cyclic orbit flag codes, yields two families of flag codes on…
In the usual procedure for toroidal Kaluza-Klein reduction, all the higher-dimensional fields are taken to be independent of the coordinates on the internal space. It has recently been observed that a generalisation of this procedure is…
We define linear and semilinear isometry for general subspace codes, used for random network coding. Furthermore, some results on isometry classes and automorphism groups of known constant dimension code constructions are derived.
A global model of $q$-deformation for the quasi--orthogonal Lie algebras generating the groups of motions of the four--dimensional affine Cayley--Klein geometries is obtained starting from the three dimensional deformations. It is shown how…
For a multi-component system, general formulas are derived for the dimension of a coexisting region in the phase diagram in various state spaces.
Grassmannian $\mathcal{G}_q(n,k)$ is the set of all $k$-dimensional subspaces of the vector space $\mathbb{F}_q^n.$ Recently, Etzion and Zhang introduced a new notion called covering Grassmannian code which can be used in network coding…
This paper presents a general coding method where data in a Hilbert space are represented by finite dimensional coding vectors. The method is based on empirical risk minimization within a certain class of linear operators, which map the set…
Coset constructions of $q$-ary Reed-Muller codes can be used to store secrets on a distributed storage system in such a way that only parties with access to a large part of the system can obtain information while still allowing for local…
AF-rings are algebras over a field k which satisfy the Altitude Formula over k. This paper surveys a few works in the literature on the Krull and valuative dimensions of tensor products of AF-rings. The first section extends Wadsworth's…
We introduce a notion of dimension for the solution set of a system of algebraic difference equations that measures the degrees of freedom when determining a solution in the ring of sequences. This number need not be an integer, but, as we…
A many variable $q$-calculus is introduced using the formalism of braided covector algebras. Its properties when certain of its deformation parameters are roots of unity are discussed in detail, and related to fractional supersymmetry. The…
We consider the geometric problem of determining the maximum number $n_q(r,h,f;s)$ of $(h-1)$-spaces in the projective space $\operatorname{PG}(r-1,q)$ such that each subspace of codimension $f$ does contain at most $s$ elements. In coding…
This paper provides new constructions and lower bounds for subspace codes, using Ferrers diagram rank-metric codes from matchings of the complete graph and pending blocks. We present different constructions for constant dimension codes with…