Related papers: Linear codes on posets with extension property
A variety of possible extensions of mappings between posets to their Dedekind order completion is presented. One of such extensions has recently been used for solving large classes of nonlinear systems of partial differential equations with…
We study triples of coisotropic or isotropic subspaces in symplectic vector spaces; in particular, we classify indecomposable structures of this kind. The classification depends on the ground field, which we only assume to be perfect and…
In this article we investigate a class of linear error correcting codes in relation with the order polytopes. In particular we consider the order polytopes of tree posets and bipartite posets. We calculate the parameters of the associated…
It is known when we call a poset P, a $\mathcal{P}$-chain permutational poset, given a subset of permutations $\mathcal{P}$ of the symmetric group $S_{n}$. In this work, we use the same idea to study subsets of words of length $n$, that are…
We show that the sequence of dimensions of the linear spaces, generated by a given rank-metric code together with itself under several applications of a field automorphism, is an invariant for the whole equivalence class of the code. These…
Rank-metric codes have been a central topic in coding theory due to their theoretical and practical significance, with applications in network coding, distributed storage, crisscross error correction, and post-quantum cryptography. Recent…
In this work we introduce the concept of a sub-space decomposition, subject to a partition of the coordinates. Considering metrics determined by partial orders in the set of coordinates, the so called poset metrics, we show the existence of…
We consider a class of linear codes associated to projective algebraic varieties defined by the vanishing of minors of a fixed size of a generic matrix. It is seen that the resulting code has only a small number of distinct weights. The…
The determination of the weight distribution of linear codes has been a fascinating problem since the very beginning of coding theory. There has been a lot of research on weight enumerators of special cases, such as self-dual codes and…
We introduce two polynomials (in $q$) associated with a finite poset $P$ that encode some information on the covering relation in $P$. If $P$ is a distributive lattice, and hence $P$ is isomorphic to the poset of dual order ideals in a…
An index coding (IC) problem consisting of a server and multiple receivers with different side-information and demand sets can be equivalently represented using a fitting matrix. A scalar linear index code to a given IC problem is a matrix…
In this paper we describe a novel a procedure to build a linear order from an arbitrary poset which (i) preserves the original ordering and (ii) allows to extend monotonic and antitonic mappings defined over the original poset to monotonic…
We study the problem of checking whether an existential sentence (that is, a first-order sentence in prefix form built using existential quantifiers and all Boolean connectives) is true in a finite partially ordered set (in short, a poset).…
We show that the sequence of dimensions of the linear spaces, generated by a given rank-metric code together with itself under several applications of a field automorphism, is an invariant for the whole equivalence class of the code. The…
As observed by Joyal, the cohomology groups of the partition posets are naturally identified with the components of the operad encoding Lie algebras. This connection was explained in terms of operadic Koszul duality by Fresse, and later…
The study of the generalized Hamming weight of linear codes is a significant research topic in coding theory as it conveys the structural information of the codes and determines their performance in various applications. However,…
We give a broad survey of inequalities for the number of linear extensions of finite posets. We review many examples, discuss open problems, and present recent results on the subject. We emphasize the bounds, the equality conditions of the…
We examine properties of generic automorphisms of the random poset, with the goal of explicitly characterizing them. We associate to each automorphism an auxiliary first-order structure, consisting of the random poset equipped with an…
In the past few years, linear codes with few weights and their weight analysis have been widely studied. In this paper, we further investigate a class of two-weight or three-weight linear codes from defining sets and determine their weight…
In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…