Related papers: State spaces of convolutional codes, codings and e…
Using tools from algebraic geometry and Groebner basis theory we solve two problems in network coding. First we present a method to determine the smallest field size for which linear network coding is feasible. Second we derive improved…
Let $F$ be a field and let $F^{r\times s}$ denote the space of $r\times s$ matrices over $F$. Given equinumerous subsets $\mathcal{A}=\{A_i\mid i \in I\}\subseteq F^{r\times r}$ and $\mathcal{B}=\{B_i\mid i\in I\}\subseteq F^{s\times s}$ we…
Braided convolutional codes (BCCs) are a class of spatially coupled turbo-like codes that can be described by a $(2,3)$-regular compact graph. In this paper, we introduce a family of $(d_v,d_c)$-regular GLDPC codes with convolutional code…
A covering code is a set of codewords with the property that the union of balls, suitably defined, around these codewords covers an entire space. Generally, the goal is to find the covering code with the minimum size codebook. While most…
High dimensional expanders simultaneously satisfying spectral and combinatorial (coboundary) expansion have recently played a major role in breakthroughs in PCP and coding theory, but the only known construction of such complexes is…
In this paper, we study the size and width of autoencoders consisting of Boolean threshold functions, where an autoencoder is a layered neural network whose structure can be viewed as consisting of an encoder, which compresses an input…
We consider the problem of describing the typical (possibly) non-linear code of minimum distance bounded from below over a large alphabet. We concentrate on block codes with the Hamming metric and on subspace codes with the injection…
In this paper, we consider the embedding relations between any two $\alpha$% -modulation spaces. Based on an observation that the $\alpha$-modulation space with smaller $\alpha$ can be regarded as a corresponding $\alpha$% -modulation space…
Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…
We study a graded vector space of polynomials associated to a square matrix, defined by a finite difference condition along the rows. We show this space coincides with one defined by directional derivatives, and prove it is…
Codes in the Grassmannian space have found recently application in network coding. Representation of $k$-dimensional subspaces of $\F_q^n$ has generally an essential role in solving coding problems in the Grassmannian, and in particular in…
Semiconstrained systems were recently suggested as a generalization of constrained systems, commonly used in communication and data-storage applications that require certain offending subsequences be avoided. In an attempt to apply…
We introduce a convolutional neural network for inferring a compact disentangled graphical description of objects from 2D images that can be used for volumetric reconstruction. The network comprises an encoder and a twin-tailed decoder. The…
The Kalman variety of a linear subspace in a vector space consists of all endomorphism that possess an eigenvector in that subspace. We study the defining polynomials and basic geometric invariants of the Kalman variety.
Nowadays there are several classes of constrained codes intended for different applications. The following two large classes can be distinguished. The first class contains codes with local constraints; for example, the source data must be…
In this paper we extend the relation between convolutional codes and linear systems over finite fields to certain commutative rings through first order representations . We introduce the definition of rings with representations as those for…
These notes follow my articles [1, 6], and give some new important details. We propose here a new combinatorial method of encoding of measure spaces with measure preserving transformations, (or groups of transformations) in order to give…
A subspace code is a nonempty set of subspaces of a vector space $\mathbb F^n_q$. Linear codes with complementary duals, or LCD codes, are linear codes whose intersection with their duals is trivial. In this paper, we introduce a notion of…
In this work, multipartite entanglement is classified by polynomials. I show that the operator size is closely related to the entanglement structure. Given a generic quantum state, I define a series of subspaces generated by operators of…
A quantum code is a subspace of a Hilbert space of a physical system chosen to be correctable against a given class of errors, where information can be encoded. Ideally, the quantum code lies within the ground space of the physical system.…