Related papers: Line Polar Grassmann Codes of Orthogonal Type
In the present paper, we show that if the dimension of an arbitrary algebraic geometry code over a finite field of even characters is slightly less than half of its length, then it is equivalent to an Euclidean self-orthogonal code.…
Erd\H{o}s conjectured in 1946 that every n-point set P in convex position in the plane contains a point that determines at least floor(n/2) distinct distances to the other points of P. The best known lower bound due to Dumitrescu (2006) is…
This paper proposes the design of polar and convolutional coset codes for the unequal message protection (UMP) in the short blocklength regime, to overcome the rate loss introduced by preamble-based solutions. After providing conditions to…
A new lower bound on the minimum distance of q-ary cyclic codes is proposed. This bound improves upon the Bose-Chaudhuri-Hocquenghem (BCH) bound and, for some codes, upon the Hartmann-Tzeng (HT) bound. Several Boston bounds are special…
The Gilbert type bound for codes in the title is reviewed, both for small and large alphabets. Constructive lower bounds better than these existential bounds are derived from geometric codes, either over Fp or Fp2 ; or over even degree…
Let $q=p^h$ be a prime power and $e$ be an integer with $0\leq e\leq h-1$. $e$-Galois self-orthogonal codes are generalizations of Euclidean self-orthogonal codes ($e=0$) and Hermitian self-orthogonal codes ($e=\frac{h}{2}$ and $h$ is…
V. Guruswami and N. Resch prove that the list decodability of $\mathbb{F}_q$-linear rank metric codes is as good as that of random rank metric codes in~\cite{venkat2017}. Due to the potential applications of self-orthogonal rank metric…
Symbol-pair codes introduced by Cassuto and Blaum (2010) are designed to protect against pair errors in symbol-pair read channels. The higher the minimum pair distance, the more pair errors the code can correct. MDS symbol-pair codes are…
In this paper, we investigate pattern avoidance of parity restricted (even or odd) Grassmannian permutations for patterns of sizes 3 and 4. We use a combination of direct counting and bijective techniques to provide recurrence relations,…
We classify rigid Schubert classes in orthogonal Grassmannians. More generally, given a representative $X$ of a Schubert class in an orthogonal Grassmannian, we give combinatorial conditions which guarantee that every linear space…
Toric codes are error-correcting codes that are derived from toric varieties, which hold a unique correspondence to integral convex polytopes. In this paper, we focus on integral convex polytopes $P \subseteq \mathbb{R}^2$ and the toric…
In this paper, we construct four families of linear codes over finite fields from the complements of either the union of subfields or the union of cosets of a subfield, which can produce infinite families of optimal linear codes, including…
We describe two different approaches to making systematic classifications of plane lattice polygons, and recover the toric codes they generate, over small fields, where these match or exceed the best known minimum distance. This includes a…
We give a lower bound for the value at q=1 of a Kazhdan-Lustig polynomial in a Weyl group W in terms of "patterns''. This is expressed by a "pattern map" from W to W' for any parabloic subgroup W'. This notion generalizes the concept of…
The finite Grassmannian $\mathcal{G}_{q}(k,n)$ is defined as the set of all $k$-dimensional subspaces of the ambient space $\mathbb{F}_{q}^{n}$. Subsets of the finite Grassmannian are called constant dimension codes and have recently found…
We derive a procedure for computing an upper bound on the number of equiangular lines in various Euclidean vector spaces by generalizing the classical pillar decomposition developed by (Lemmens and Seidel, 1973); namely, we use linear…
This paper presents a puncturing technique to design length-compatible polar codes. The punctured bits are identified with the help of differential evolution (DE). A DE-based optimization framework is developed where the sum of the…
A recent result of S.-Y. Lee and M. Yang states that the planar orthogonal polynomials orthogonal with respect to a modified Gaussian measure are multiple orthogonal polynomials of type II on a contour in the complex plane. We show that the…
The paper presents a method to generate some families of linear codes over finite fields of characteristics greater than two in the widest class due to the size of Grassmann manifold, i.e. when the dimension is equal to codimension. Our…
Given a finite Lie incidence geometry which is either a polar space of rank at least $3$ or a strong parapolar space of symplectic rank at least $4$ and diameter at most $4$, or the parapolar space arising from the line Grassmannian of a…