Related papers: On dual toric complete intersection codes

In this paper, we construct MDS Euclidean self-dual codes which are extended cyclic duadic codes. And we obtain many new MDS Euclidean self-dual codes. We also construct MDS Hermitian self-dual codes from generalized Reed-Solomon codes and…

In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction…

General isometries of cyclic codes, including multipliers and translations, are introduced; and isometrically self-dual cyclic codes are defined. In terms of Type-I duadic splittings given by multipliers and translations, a necessary and…

We describe a general algorithm for computing intersection pairings on arithmetic surfaces. We have implemented our algorithm for curves over $\mathbb Q$, and we show how to use it to compute regulators for a number of Jacobians of smooth…

For any simple digraph $D$ we offer a new proof for the intersection number of its middle digraph, $M(D)$; while doing so we also solve for the intersection number when $D$ has loops. In addition, a new transformation, the union of $D$ and…

We study the combinatorial complexity of D-dimensional polyhedra defined as the intersection of n halfspaces, with the property that the highest dimension of any bounded face is much smaller than D. We show that, if d is the maximum…

In this paper, we provide a polynomial characterization of linear complementary pairs of quasi-cyclic and quasi-twisted codes of index 2. We also give several examples of linear complementary pairs of quasi-cyclic and quasi-twisted codes…

In this paper, we obtain some new results on the existence of MDS self-dual codes utilizing (extended) generalized Reed-Solomon codes over finite fields of odd characteristic. For some fixed $q$, our results can produce more classes of MDS…

MDS codes and self-dual codes are important families of classical codes in coding theory. It is of interest to investigate MDS self-dual codes. The existence of MDS self-dual codes over finite field $F_q$ is completely solved for $q$ is…

Let $F$ be a homogeneous polynomial in $n$ variables of degree $d$ over a field $K$. Let $A(F)$ be the associated Artinian graded $K$-algebra. If $B \subset A(F)$ is a subalgebra of $A(F)$ which is Gorenstein with the same socle degree as…

Let C \in P2 be a reduced, singular curve of degree d and equation f = 0. Let \Sigma denote the jacobian subscheme of C. We have 0 -> E -> 3.O -> I_\Sigma(d-1) -> 0 (the surjection is given by the partials of f). We study the relationships…

Given an ordered sequence of $N$-choose-2 integers, we give necessary and sufficient conditions to have an ordered collection of $N$ simple closed curves on a torus such that the algebraic pairwise intersections of those curves are the…

We propose a full-rate iterated space-time code construction, to design 2n-dimensional codes from n-dimensional cyclic algebra based codes. We give a condition to determine whether the resulting codes satisfy the full-diversity property,…

An important question in the study of quasi-perfect codes is whether such codes can be constructed for all possible lengths $n$. In this paper, we address this question for specific values of $n$. First, we investigate the existence of…

Let $V$ be a degree $d$, reduced hypersurface in $\mathbb{CP}^{n+1}$, $n \geq 1$, and fix a generic hyperplane, $H$. Denote by $\mathcal{U}$ the (affine) hypersurface complement, $\mathbb{CP}^{n+1}- V \cup H$, and let $\mathcal{U}^c$ be the…

In this paper, constructions of some double circulant self-dual codes by generalized cyclotomic classes of order two are presented. This technique is applied to [72, 36, 12] binary highest know self-dual codes to obtain self-dual codes over…

We study the situation when the T-dual of a toric K\"ahler geometry is a generalized K\"ahler geometry involving semi-chiral fields. We explain that this situation is generic for polycylinders, tori and related geometries. Gauging multiple…

If every vertex in a map has one out of two face-cycle types, then the map is said to be $2$-semiequivelar. A 2-uniform tiling is an edge-to-edge tiling of regular polygons having $2$ distinct transitivity classes of vertices. Clearly, a…

We investigate the intersection body of a convex polytope using tools from combinatorics and real algebraic geometry. In particular, we show that the intersection body of a polytope is always a semialgebraic set and provide an algorithm for…

The dual codes of the ternary linear codes of the residual designs of biplanes on 56 points are used to prove the nonexistence of quasi-symmetric 2-$(56,12,9)$ and 2-$(57,12,11)$ designs with intersection numbers 0 and 3, and the…