Related papers: Function-Based Minimal Linear Codes over Galois Ri…
Function-correcting codes are a coding framework designed to minimize redundancy while ensuring that specific functions or computations of encoded data can be reliably recovered, even in the presence of errors. The choice of metric is…
We construct a local deformation problem for residual Galois representations $\bar{\rho}$ valued in an arbitrary reductive group $\hat{G}$ which we use to develop a variant of the Taylor-Wiles method. Our generalization allows Taylor-Wiles…
Linear codes with few weights have applications in consumer electronics, communication, data storage system, secret sharing, authentication codes, association schemes, and strongly regular graphs. This paper first generalizes the method of…
In this article, first we present a method for constructing many Hermitian LCD codes from a given Hermitian LCD code, and then provide several methods which utilize either a given [n, k, d] linear code or a given [n, k, d] Galois LCD code…
Linear codes are widely studied in coding theory as they have nice applications in distributed storage, combinatorics, lattices, cryptography and so on. Constructing linear codes with desirable properties is an interesting research topic.…
We review the concept of differentiably simple ring and we give a new proof of Harper's Theorem on the characterization of Noetherian differentiably simple rings in positive characteristic. We then study flat families of differentiably…
A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field was recently presented in [10]. Shortly after this, a generalization for the sufficient numerical conditions of such characterization…
Inspired by the Taubes-Wu construction of $\mathcal{C}^{1,\alpha}$ two-valued harmonic functions by the use of symmetry, we construct minimal surfaces with stratified branching sets as graphs of $\mathcal{C}^{1,\alpha}$ two-valued…
Let R > S be finite Frobenius rings for which there exists a trace map T from R onto S as left S modules. Let C:= {x -> T(ax + bf(x)) : a,b in R}. Then C is an S-linear subring-subcode of a left linear code over R. We consider functions f…
In this note we reduce certain proofs in \cite{KS, Karl, AMA} to depth two quasibases from one side only. This minimalistic approach leads to a characterization of Galois extensions for finite projective bialgebroids without the Frobenius…
The general Galois theory for functions and relational constraints over arbitrary sets described in the authors' previous paper is refined by imposing algebraic conditions on relations.
The hull of linear codes plays an important role in quantum information and coding theory. In the present paper, by investigating the Galois hulls of generalized Reed-Solomon (GRS) codes and extended GRS codes over the finite field Fq, we…
In $1991$, Wei proved a duality theorem that established an interesting connection between the generalized Hamming weights of a linear code and those of its dual code. Wei's duality theorem has since been extensively studied from different…
Let $k\leq n$ be two positive integers and $q$ a prime power. The basic question in minimal linear codes is to determine if there exists an $[n,k]_q$ minimal linear code. The first objective of this paper is to present a new sufficient and…
In this paper we construct Galois towers with good asymptotic properties over any non-prime finite field $\mathbb F_{\ell}$; i.e., we construct sequences of function fields $\mathcal{N}=(N_1 \subset N_2 \subset \cdots)$ over $\mathbb…
This work provides closed-form solutions and minimum achievable errors for a large class of low-rank approximation problems in Hilbert spaces. The proposed theorem generalizes to the case of bounded linear operators the previous results…
The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2].…
We establish arithmetic duality theorems for short complexes associated to reductive groups over $p$-adic function fields. Using dualities, we deduce obstructions to weak approximation for certain reductive groups (especially quasi-split…
A natural construction of the logarithmic extension of the M(2,p) minimal models is presented, which generalises our previous model [0708.0802] of percolation (p=3). Its key aspect is the replacement of the minimal model irreducible modules…
Minimal linear codes are algebraic objects which gained interest in the last twenty years, due to their link with Massey's secret sharing schemes. In this context, Ashikhmin and Barg provided a useful and a quite easy to handle sufficient…