Related papers: A new coding theory, for normal surfaces, and ADE …
Long linear codes constructed from toric varieties over finite fields, their multiplicative structure and decoding. The main theme is the inherent multiplicative structure on toric codes. The multiplicative structure allows for…
The concept of Generalized Inverse based Decoding (GID) is introduced, as an algebraic framework for the syndrome decoding problem (SDP) and low weight codeword problem (LWP). The framework has ground on two characterizations by generalized…
A large class of MDS linear codes is constructed. These codes are endowed with an efficient decoding algorithm. Both the definition of the codes and the design of their decoding algorithm only require from Linear Algebra methods, making…
A discrete conformality for polyhedral metrics on surfaces is introduced in this paper which generalizes earlier work on the subject. It is shown that each polyhedral metric on a surface is discrete conformal to a constant curvature…
Coded computing has emerged as a promising framework for tackling significant challenges in large-scale distributed computing, including the presence of slow, faulty, or compromised servers. In this approach, each worker node processes a…
We study families of deformed ADE surfaces by probing them with a D2-brane in Type IIA string theory. The geometry of the total space $X$ of such a family can be encoded in a scalar field $\Phi$, which lives in the corresponding ADE algebra…
We show that string theory with Dirichlet boundaries is equivalent to string theory containing surfaces with certain singular points. Surface curvature is singular at these points. A singular point is resolved in conformal coordinates to a…
The $k$-dimensional coding schemes refer to a collection of methods that attempt to represent data using a set of representative $k$-dimensional vectors, and include non-negative matrix factorization, dictionary learning, sparse coding,…
Degeneracy is a salient feature of genetic codes, because there are more codons than amino acids. The conventional table for genetic codes suffers from an inability of illustrating a symmetrical nature among genetic base codes. In fact,…
This is a survey of the method of graph cuts and its applications to graph clustering of weighted unsigned and signed graphs. I provide a fairly thorough treatment of the method of normalized graph cuts, a deeply original method due to Shi…
We propose a computation of curvature of arbitrary two-dimensional surfaces of three-dimensional objects, which is a contribution to discrete gravity with potential applications in network geometry. We begin by linking each point of the…
We describe smooth rational projective algebraic surfaces over an algebraically closed field of characteristic different from 2 which contain $n \ge \b_2-2$ disjoint smooth rational curves with self-intersection -2, where $\b_2$ is the…
Using Serre's adelic interpretation of cohomology, we develop a `differential and integral calculus' on an algebraic curve X over an algebraically closed filed k of constants of characteristic zero, define algebraic analogs of additive…
This chapter introduces and elaborates on the fruitful interplay of coding theory and algebraic combinatorics, with most of the focus on the interaction of codes with combinatorial designs, finite geometries, simple groups, sphere packings,…
We utilize the symmetry groups of regular tessellations on two-dimensional surfaces of different constant curvatures, including spheres, Euclidean planes and hyperbolic planes, to encode a qubit or qudit into the physical degrees of freedom…
We propose a decoding method for the generalized algebraic geometry codes proposed by Xing et al. To show its practical usefulness, we give an example of generalized algebraic geometry codes of length 567 over F_8 whose numbers of…
\noindent The algebraic characterization of classes of locally isomorphic aperiodic tilings, being examples of quantum spaces, is conducted for a certain type of tilings in a manner proposed by A. Connes. These $2$-dimensional tilings are…
We consider combinatorial maps with fixed combinatorial knot numbered with augmenting numeration called normalized knot. We show that knot's normalization doesn't affect combinatorial map what concerns its generality. Knot's normalization…
We introduce a new paradigm for geometry denoising using prior knowledge about the surface normal vector. This prior knowledge comes in the form of a set of preferred normal vectors, which we refer to as label vectors. A segmentation…
In the first part of this article, we consider ruled surfaces defined over a finite field; we introduce invariants for them, and describe some explicit contructions that illustrate possible behaviour of these invariants. In the second part,…