Related papers: The Geometry of Homogeneous Two-Weight Codes

Graphical designs are an extension of spherical designs to functions on graphs. We connect linear codes to graphical designs on cube graphs, and show that the Hamming code in particular is a highly effective graphical design. We show that…

Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…

In this work, we study codes over the ring R_{k,m}=F_2[u,v]/<u^{k},v^{m},uv-vu>, which is a family of Frobenius, characteristic 2 extensions of the binary field. We introduce a distance and duality preserving Gray map from R_{k,m} to…

In `A survey of two-graphs' \cite{Sei}, J.J. Seidel lays out the connections between simple graphs, two-graphs, equiangular lines and strongly regular graph. It is well known that there is a one-to-one correspondence between regular…

In this paper we offer a metric similar to graph edit distance which measures the distance between two (possibly infinite)weighted graphs with finite norm (we define the norm of a graph as the sum of absolute values of its edges). The main…

The Frobenius manifold structure on the space of rational functions with multiple simple poles is constructed. In particular, the dependence of the Saito-flat coordinates on the flat coordinates of the intersection form is studied. While…

This Diplom thesis provides an explicit construction of a quantum Goppa code for any hyperelliptic curve over a non-binary field. Hyperelliptic curves have conjugate pairs of rational places. We use these pairs to construct self-orthogonal…

A graph is 2-degenerate if every subgraph contains a vertex of degree at most 2. We show that every 2-degenerate graph can be drawn with straight lines such that the drawing decomposes into 4 plane forests. Therefore, the geometric…

The following article is an application of commutative algebra to the study of multiparameter persistent homology in topological data analysis. In particular, the theory of finite free resolutions of modules over polynomial rings is applied…

In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…

We study pairs of non-constant maps between two integral schemes of finite type over two (possibly different) fields of positive characteristic. When the target is quasi-affine, Tamagawa showed that the two maps are equal up to a power of…

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…

Based on cyclic and consta-cyclic simplex codes, a new explicit construction of a family of two-weight codes is presented. These two-weight codes obtained are in the form of 2-generator quasi-cyclic, or quasi-twisted structure. Based on…

We investigate linear codes over the ring $\mathbb{Z}_4 + u\mathbb{Z}_4 + v\mathbb{Z}_4 + w\mathbb{Z}_4 + uv\mathbb{Z}_4 + uw\mathbb{Z}_4 + vw\mathbb{Z}_4 + uvw\mathbb{Z}_4$, with conditions $u^2=u$, $v^2=v$, $w^2=w$, $uv=vu$, $uw=wu$ and…

We prove the rigidity of isotropic harmonic maps from a 2-torus to a complex projective space, when they are constructed from holomorphic embeddings associated to complete linear systems. We also prove that this rigidity holds for any…

Let $G$ be a connected graph and let $\mathbb{X}$ be the set of projective points defined by the column vectors of the incidence matrix of $G$ over a field $K$ of any characteristic. We determine the generalized Hamming weights of the…

We study trace codes with defining set $L,$ a subgroup of the multiplicative group of an extension of degree $m$ of the alphabet ring $\mathbb{F}_3+u\mathbb{F}_3+u^{2}\mathbb{F}_{3},$ with $u^{3}=1.$ These codes are abelian, and their…

Let $\mathcal{D}$ be a weighted oriented graph and let $I(\mathcal{D})$ be its edge ideal in a polynomial ring $R$. We give the formula of Castelnuovo-Mumford regularity of $R/I(\mathcal{D})$ when $\mathcal{D}$ is a weighted oriented path…

We construct linear codes over the finite field Fq from arbitrary simplicial complexes, establishing a connection between topological properties and fundamental coding parameters. First, we study the behaviour of the weights of codewords…

A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite simple graphs in R^d with respect to the classical l^p norms, for d>1 and 1<p<\infty. Generalisations are obtained for the Laman and…