Related papers: Error Correcting Codes From General Linear Groups
Let $q$ be a prime power. This paper provides a new class of linear codes that arises from the action of the alternating group on $\mathbb F_q[x_1,\dots,x_m]$ combined with the ideas in (M. Datta and T. Johnsen, 2022). Compared with…
Some linear codes associated to maximal algebraic curves via Feng-Rao construction are investigated. In several case, these codes have better minimum distance with respect to the previously known linear codes with same length and dimension.
Detecting polygons defined by a set of line segments in a plane is an important step in analyzing vector drawings. This paper presents an approach combining several algorithms to detect basic polygons from arbitrary line segments. The…
An integer program (IP) with a finite number of feasible solutions may have an unbounded linear programming relaxation if it contains irrational parameters, due to implicit constraints enforced by the irrational numbers. We show that those…
Linear programming (LP) decoding approximates maximum-likelihood (ML) decoding of a linear block code by relaxing the equivalent ML integer programming (IP) problem into a more easily solved LP problem. The LP problem is defined by a set of…
I provide methods of constructing elliptic and hyperelliptic curves over global fields with interesting rational points over the given fields or over large field extensions. I also provide a elliptic curves defined over any given number…
We consider a new class of linear codes, called affine Grassmann codes. These can be viewed as a variant of generalized Reed-Muller codes and are closely related to Grassmann codes. We determine the length, dimension, and the minimum…
The $q$-ary block codes with two distances $d$ and $d+1$ are considered. Several constructions of such codes are given, as in the linear case all codes can be obtained by a simple modification of linear equidistant codes. Upper bounds for…
Several relations and bounds for the dimension of principal ideals in group algebras are determined by analyzing minimal polynomials of regular representations. These results are used in the two last sections. First, in the context of…
This note further addresses the global optimization problem for max-plus linear systems considered in [Automatica 119 (2020) 109104]. Firstly, the operations between infinity elemens and real numbers involved in the formulas of solving…
We determine the Weierstrass semigroup $H(P_{\infty}, P_{1}, \ldots , P_{m})$ at several points on the $GK$ curve. In addition, we present conditions to find pure gaps on the set of gaps $G(P_{\infty}, P_{1}, \ldots , P_{m})$. Finally, we…
In coding theory, constructing codes with good parameters is one of the most important and fundamental problems. Though a great many of good codes have been produced, most of them are defined over alphabets of sizes equal to prime powers.…
In this article, we consider the decoding problem of Grassmann codes using majority logic. We show that for two points of the Grassmannian, there exists a canonical path between these points once a complete flag is fixed. These paths are…
Graph code is a linear code obtained from linear codes $C$ and a certain bipartite graph G. In this paper, I propose an expansion of the definition of graph code to general $l$-partite, and give its lower bound of minimum distance. I also…
A lower bound on the maximum likelihood (ML) decoding error exponent of linear block code ensembles, on the erasure channel, is developed. The lower bound turns to be positive, over an ensemble specific interval of erasure probabilities,…
In this paper we construct parameterizations of elliptic curves over the rationals which have many consecutive integral multiples. Using these parameterizations, we perform searches in GMP and Magma to find curves with points of small…
We introduce new yet easily accessible codes for elements of $GL_r(A)$ with $A$ the adelic ring of a (dimension one) function field over a finite field. They are linear codes, and coincide with classical algebraic geometry codes when $r=1$.…
We study scalar-linear and vector-linear solutions to the generalized combination network. We derive new upper and lower bounds on the maximum number of nodes in the middle layer, depending on the network parameters. These bounds improve…
We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…
Whereas many results are known about thresholds for ensembles of low-density parity-check codes under message-passing iterative decoding, this is not the case for linear programming decoding. Towards closing this knowledge gap, this paper…