English
Related papers

Related papers: Function-Based Minimal Linear Codes over Galois Ri…

200 papers

In this paper, we present a new bordered construction for self-dual codes which employs $\lambda$-circulant matrices. We give the necessary conditions for our construction to produce self-dual codes over a finite commutative Frobenius ring…

Information Theory · Computer Science 2023-03-24 Joe Gildea , Adrian Korban , Adam Michael Roberts , Alexander Tylyshchak

We prove model completeness for the theory of addition and the Frobenius map for certain subrings of rational functions in positive characteristic. More precisely: Let $p$ be a prime number, $\mathbb{F}_{p}$ the prime field with $p$…

Logic · Mathematics 2021-07-26 Dimitra Chompitaki , Manos Kamarianakis , Thanases Pheidas

Bounds on linear codes play a central role in coding theory, as they capture the fundamental trade-off between error-correction capability (minimum distance) and information rate (dimension relative to length). Classical results…

Information Theory · Computer Science 2025-09-04 Liren Lin , Guanghui Zhang , Bocong Chen , Hongwei Liu

Limit computable functions can be characterized by Turing jumps on the input side or limits on the output side. As a monad of this pair of adjoint operations we obtain a problem that characterizes the low functions and dually to this…

Logic · Mathematics 2023-06-22 Vasco Brattka

In recent literature, matrix product (MP) codes and their duals have gained significant attention due to their application in the construction of quantum stabilizer codes. In this paper, we begin with providing a formula that characterizes…

Information Theory · Computer Science 2024-08-07 Ramy Farouk Taki Eldin

We prove the modularity of minimally ramified ordinary residually reducible p-adic Galois representations of an imaginary quadratic field F under certain assumptions. We first exhibit conditions under which the residual representation is…

Number Theory · Mathematics 2010-06-15 Tobias Berger , Krzysztof Klosin

In this present work, we generalize the study of construction of DNA codes over the rings $\mathcal{R}_\theta=\mathbb{Z}_4+w\mathbb{Z}_4$, $w^2 = \theta $ for $\theta \in \mathbb{Z}_4+w\mathbb{Z}_4$. Rigorous study along with…

Information Theory · Computer Science 2021-10-19 Adel Alahmadi , Krishna Gopal Benerjee , Sourav Deb , Manish K Gupta

A novel implementation of a special class of Galois ring, in which the multiplication can be realized by a cyclic convolution, is applied to the construction of network codes. The primitive operations involved are byte-wise shifts and…

Information Theory · Computer Science 2020-05-18 Kenneth W. Shum , Hanxu Hou

In this paper we will estimate the main parameters of some evaluation codes which are known as projective parameterized codes. We will find the length of these codes and we will give a formula for the dimension in terms of the Hilbert…

Information Theory · Computer Science 2011-12-16 Manuel Gonzalez Sarabia , Carlos Renteria Marquez , Eliseo Sarmiento Rosales

The Galois hulls of linear codes are a generalization of the Euclidean and Hermitian hulls of linear codes. In this paper, we study the Galois hulls of (extended) GRS codes and present several new constructions of MDS codes with Galois…

Information Theory · Computer Science 2022-09-20 Yang Li , Shixin Zhu , Pi Li

Rank-metric codes, defined as sets of matrices over a finite field with the rank distance, have gained significant attention due to their applications in network coding and connections to diverse mathematical areas. Initially studied by…

Information Theory · Computer Science 2026-01-23 Alessandro Neri , Ferdinando Zullo

The fundamental concepts in the Galois Theory are separable, normal and Galois field extensions. These concepts are central in proofs of the Galois Theory. In the paper, we introduce a new approach, a ring theoretic approach, to the Galois…

Number Theory · Mathematics 2025-09-03 V. V. Bavula

We describe a new class of list decodable codes based on Galois extensions of function fields and present a list decoding algorithm. These codes are obtained as a result of folding the set of rational places of a function field using…

Information Theory · Computer Science 2009-01-12 Ming-Deh Huang , Anand Kumar Narayanan

We consider codes defined over an affine algebra $\mathcal A=R[X_1,\dots,X_r]/\left\langle t_1(X_1),\dots,t_r(X_r)\right\rangle$, where $t_i(X_i)$ is a monic univariate polynomial over a finite commutative chain ring $R$. Namely, we study…

Information Theory · Computer Science 2017-09-19 E. Martínez-Moro , A. Piñera-Nicolás , I. F. Rúa

A key idea in convex optimization theory is to use well-structured affine functions to approximate general functions, leading to impactful developments in conjugate functions and convex duality theory. This raises the question: what are the…

Optimization and Control · Mathematics 2025-04-22 Ningji Wei

Galois images of polycyclic codes over a finite chain ring $S$ and their annihilator dual are investigated. The case when a polycyclic codes is Galois-disjoint over the ring $S,$ is characterized and, the trace codes and restrictions of…

Information Theory · Computer Science 2018-11-21 Edgar Martínez-Moro , Alexandre Fotue , Thomas Blackford

In this paper, our aim is twofold: First, by using the technique of gluing semigroups, we give infinitely many families of a projective closure with the Cohen-Macaulay (Gorenstein) property. Also, we give an effective technique for…

Commutative Algebra · Mathematics 2023-11-21 Sanjay Kumar Singh , Pranjal Srivastava

Let $L/K$ be a finite Galois, totally ramified $p$-extension of complete local fields with perfect residue fields of characteristic $p>0$. In this paper, we give conditions, valid for any Galois $p$-group $G={Gal}(L/K)$ (abelian or not) and…

Number Theory · Mathematics 2017-07-20 Nigel P. Byott , G. Griffith Elder

The interrelation between the cyclic structure of an ideal, i.e., a cyclic code over Galois field $GF(q)$, $q>2$, and its classes of proportional elements is considered. This relation is used in order to define the code's weight structure.…

Number Theory · Mathematics 2007-05-23 I. Mullayeva

In this paper, we propose and study $r$-minimal codes, a natural extension of minimal codes which have been extensively studied with respect to Hamming metric, rank metric and sum-rank metric. We first propose $r$-minimal codes in a general…

Information Theory · Computer Science 2024-08-29 Yang Xu , Haibin Kan , Guangyue Han