Related papers: Linear codes on posets with extension property
The MacWilliams Extension Theorem states that each linear Hamming isometry of a linear code extends to a monomial map. In this paper an analogue of the extension theorem for linear codes over a module alphabet is observed. A geometric…
The notion of L-homologies (of double complexes) as proposed in this paper extends the notion of classical horizontal and vertical homologies, along with two other new homologies introduced in the homological diagram lemma called salamander…
This article aims to explore the bridge between the algebraic structure of a linear code and the complete decoding process. To this end, we associate a specific binomial ideal $I_+(\mathcal C)$ to an arbitrary linear code. The binomials…
We introduce several new constructions of finite posets with the number of linear extensions given by generalized continued fractions. We apply our results to the problem of the minimum number of elements needed for a poset with a given…
We study the category whose objects are trees (with or without roots) and whose morphisms are contractions. We show that the corresponding contravariant module categories are Noetherian, and we study two natural families of modules over…
We propose a unified theory of generalized weights for linear codes endowed with an arbitrary distance. Instead of relying on supports or anticodes, the weights of a code are defined via the intersections of the code with a chosen family of…
Recent work in learning ontologies (hierarchical and partially-ordered structures) has leveraged the intrinsic geometry of spaces of learned representations to make predictions that automatically obey complex structural constraints. We…
Two natural foliations, guided by area and perimeter, of the configurations spaces of planar polygons are considered and the topology of their leaves is investigated in some detail. In particular, the homology groups and the homotopy type…
We investigate the problem of type isomorphisms in the presence of higher-order references. We first introduce a finitary programming language with sum types and higher-order references, for which we build a fully abstract games model…
We study the number of linear extensions of a partial order with a given proportion of comparable pairs of elements, and estimate the maximum and minimum possible numbers. We also consider a random interval partial order on $n$ elements,…
Partially ordered sets (posets) play a universal role as an abstract structure in many areas of mathematics. For finite posets, an explicit enumeration of distinct partial orders on a set of unlabelled elements is known only up to a…
In our recent paper we characterized the extension property for symmetrized weight composition for linear codes over a module alphabet. Several improvements for the case of vector space alphabets are given in this paper. A detailed…
The classical 1991 result by Brightwell and Winkler states that the number of linear extensions of a poset is #P-complete. We extend this result to posets with certain restrictions. First, we prove that the number of linear extension for…
The general purpose bitensorially gauge-covariant differentiation procedure set up in the preceding article is specialised to the particular case of bundles with nonlinear fibres that are endowed with a torsion free Riemannian or…
Two-weight linear codes are linear codes in which any nonzero codeword can have only two possible distinct weights. Those in the Hamming metric have proven to be very interesting for their connections with authentication codes, association…
We study $q$-ary codes with distance defined by a partial order of the coordinates of the codewords. Maximum Distance Separable (MDS) codes in the poset metric have been studied in a number of earlier works. We consider codes that are close…
We study the conditions under which the isometry of spaces with metrics generated by weights given on the edges of finite trees is equivalent to the isomorphism of these trees. Similar questions are studied for ultrametric spaces generated…
We construct unitary modular categories for a general class of coset conformal field theories based on our previous study of these theories in the algebraic quantum field theory framework using subfactor theory. We also consider the…
A finite poset X carries a natural structure of a topological space. Fix a field k, and denote by D(X) the bounded derived category of sheaves of finite dimensional k-vector spaces over X. Two posets X and Y are said to be derived…
The interplay between coding theory and $t$-designs has attracted a lot of attention for both directions. It is well known that the supports of all codewords with a fixed weight in a code may hold a $t$-design. In this paper, by determining…