English
Related papers

Related papers: Consta-dihedral Codes over Finite Fields

200 papers

In this paper, we give an important isomorphism between contacyclic codes and cyclic codes over finite principal ideal rings. Necessary and sufficient conditions for the existence of non-trivial cyclic self-dual codes over finite principal…

Information Theory · Computer Science 2015-05-06 Aicha Batoul , Kenza Guenda , T. Aaron Gulliver

In this paper, we study the dihedral codes, i.e. the left ideals of $\mathbb{F}_qD_{n}$ in the case $\gcd(q, n) = 1$. An explicit algebraic description of the dihedral codes and their duals is obtained. In addition, a criterion for…

Rings and Algebras · Mathematics 2021-03-02 Kirill V. Vedenev , Vladimir M. Deundyak

Assuming two deep but standard conjectures from the Langlands Programme, we prove that the asymptotic Fermat's Last Theorem holds for imaginary quadratic fields Q(\sqrt{-d}) with -d=2, 3 mod 4. For a general number field K, again assuming…

Number Theory · Mathematics 2016-11-01 Mehmet Haluk Sengun , Samir Siksek

Let $X$ be a proper metric space and let $F$ be a finite group acting on $X$ by isometries. We show that the asymptotic dimension of $F\backslash X$ is the same as the asymptotic dimension of $X$.

General Topology · Mathematics 2017-08-25 Daniel Kasprowski

Constacyclic codes over finite fields are of theoretical importance as they are closely related to a number of areas of mathematics such as algebra, algebraic geometry, graph theory, combinatorial designs and number theory. However, the…

Information Theory · Computer Science 2026-05-08 Hongsheng Hu , Nian Li , Yanan Wu , Xiangyong Zeng

In this paper, several conjectures proposed in [2] are studied, involving the equivalence and duality of polycyclic codes associated with trinomials. According to the results, we give methods to construct isodual and self-dual polycyclic…

Information Theory · Computer Science 2022-05-03 Minjia Shi , Haodong Lu , Shuang Zhou , Jiarui Xu , Yuhang Zhu

Linear codes with complementary duals are linear codes whose intersection with their duals are trivial, shortly named LCD codes. In this paper we outline a construction for LCD codes over finite fields of order $q$ using weighing matrices…

Combinatorics · Mathematics 2019-12-02 Dean Crnkovic , Ronan Egan , B. G. Rodrigues , Andrea Svob

We consider two-dimensional $(\lambda_1, \lambda_2)$-constacyclic codes over $\mathbb{F}_{q}$ of area $M N$, where $q$ is some power of prime $p$ with $\gcd(M,p)=1$ and $\gcd(N,p)=1$. With the help of common zero (CZ) set, we characterize…

Information Theory · Computer Science 2025-12-24 Vidya Sagar , Shikha Patel , Ashutosh Singh , Shayan Srinivasa Garani

Let $K$ be a number field. Using the modular method, we prove asymptotic results on solutions of the Diophantine equation $x^4-y^2=z^p$ over $K$, assuming some deep but standard conjectures of the Langlands programme when $K$ has at least…

Number Theory · Mathematics 2022-09-20 Lucas Villagra Torcomian

The aim of this paper is to give conditions for the equivalency between skew constacyclic codes, skew cyclic codes and skew negacyclic codes defined over semi-local rings. Also, we provide construction and an enumeration of Euclidean and…

Information Theory · Computer Science 2019-02-25 Ranya D. Boulanouar , Aicha Batoul

A linear code is said to be self-orthogonal if it is contained in its dual. Self-orthogonal codes are of interest because of their important applications, such as for constructing linear complementary dual (LCD) codes and quantum codes. In…

Information Theory · Computer Science 2023-12-08 Dengcheng Xie , Shixin Zhu , Yang Li

A flag $C_0 \subsetneq C_1 \cdots \subsetneq C_s \subsetneq {\mathbb F}_q^n $ of linear codes is said to be self-orthogonal if the duals of the codes in the flag satisfy $C_{i}^\perp=C_{s-i}$, and it is said to satisfy the isometry-dual…

Information Theory · Computer Science 2024-06-14 Maria Bras-Amorós , Alonso S. Castellanos , Luciane Quoos

We present some distinct asymptotic properties of solutions to Caputo fractional differential equations (FDEs). First, we show that the non-trivial solutions to a FDE can not converge to the fixed points faster than $t^{-\alpha}$, where…

Classical Analysis and ODEs · Mathematics 2020-02-17 N. D. Cong , H. T. Tuan , Hieu Trinh

In this paper we give the enumeration formulas for Euclidean self-dual skew-cyclic codes over finite fields when $(n,|\theta|)=1$ and for some cases when $(n,|\theta|)>1,$ where $n$ is the length of the code and $|\theta|$ is the order of…

Information Theory · Computer Science 2017-05-18 Irwansyah , Intan Muchtadi-Alamsyah , Ahmad Muchlis , Aleams Barra , Djoko Suprijanto

If C is a binary linear code, let C^2 be the linear code spanned by intersections of pairs of codewords of C. We construct an asymptotically good family of binary linear codes such that, for C ranging in this family, the C^2 also form an…

Information Theory · Computer Science 2012-09-03 Hugues Randriambololona

Our aim in this paper is to investigate the asymptotic behavior of solutions of the perturbed linear fractional differential system. We show that if the original linear autonomous system is asymptotically stable then under the action of…

Dynamical Systems · Mathematics 2018-08-24 N. D. Cong , T. S. Doan , H. T. Tuan

Let $q$ be a quadratic form over a field $F$ and let $L$ be a field extension of $F$ of odd degree. It is a classical result that if $q_L$ is isotropic (resp. hyperbolic) then $q$ is isotropic (resp. hyperbolic). In turn, given two…

Number Theory · Mathematics 2014-07-04 Jodi Black , Anne Quéguiner-Mathieu

Let $f(u)$ be a polynomial of degree $m, m \geq 2,$ which splits into distinct linear factors over a finite field $\mathbb{F}_{q}$. Let $\mathcal{R}=\mathbb{F}_{q}[u]/\langle f(u)\rangle$ be a finite non-chain ring. In an earlier paper, we…

Information Theory · Computer Science 2018-05-25 Mokshi Goyal , Madhu Raka

A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important question is whether there exist LTCs that have the ccc-property:…

Computational Complexity · Computer Science 2010-12-14 Irit Dinur , Tali Kaufman

Let $k$ be an $F$-finite field containing an infinite perfect field of positive characteristic. Let $(X, \Delta)$ be a projective log canonical pair over $k$. In this note we show that, for a semi-ample divisor $D$ on $X$, there exists an…

Algebraic Geometry · Mathematics 2017-03-21 Hiromu Tanaka
‹ Prev 1 3 4 5 6 7 10 Next ›