English
Related papers

Related papers: The trace dual of nonlinear skew cyclic codes

200 papers

Let $p\neq3$ be any prime and $l\neq3$ be any odd prime with $gcd(p,l)=1$. $F_{q}^{*}=\langle\xi\rangle$ is decomposed into mutually disjoint union of $gcd(q-1,3lp^{s})$ coset over the subgroup $\langle\xi^{3lp^{s}}\rangle$, where $\xi$ is…

Information Theory · Computer Science 2016-01-25 Li Liu , Lanqiang Li , Xiaoshan Kai , Shixin Zhu

The first purpose of this paper is to give the fnite transcendence of Frobenius traces for elliptic curves over $\mathbb{Q}$ without the assumption of complex multiplication (CM). This result generalizes the previous work by Luca and…

Number Theory · Mathematics 2026-05-22 Yuto Tsuruta

Let $\mathrm{SLAut}(\mathbb{F}_{q}^{n})$ denote the group of all semilinear isometries on $\mathbb{F}_{q}^{n}$, where $q=p^{e}$ is a prime power. In this paper, we investigate general properties of linear codes associated with $\sigma$…

Information Theory · Computer Science 2023-03-27 Meng Cao , Jing Yang

This paper present the construction cyclic isodual codes over finite fields and finite chain rings. These codes are monomially equivalent to their dual. Conditions are given for the existence of cyclic isodual codes. In addition, the…

Information Theory · Computer Science 2016-08-16 Aicha Batoul , Kenza Guenda , T. Aaron Gulliver , Nuh Aydin

Let $q$ be a prime power and let $\mathcal{R}=\mathbb{F}_{q}[u_1,u_2, \cdots, u_k]/\langle f_i(u_i),u_iu_j-u_ju_i\rangle$ be a finite non-chain ring, where $f_i(u_i), 1\leq i \leq k$ are polynomials, not all linear, which split into…

Information Theory · Computer Science 2022-12-07 Swati Bhardwaj , Mokshi Goyal , Madhu Raka

Let $f(u)$ and $g(v)$ be any two polynomials of degree $k$ and $\ell$ respectively ($k$ and $\ell$ are not both $1$), which split into distinct linear factors over $\mathbb{F}_{q}$. Let $\mathcal{R}=\mathbb{F}_{q}[u,v]/\langle…

Information Theory · Computer Science 2018-11-06 Mokshi Goyal , Madhu Raka

Linear complementary pairs (LCP) of codes play an important role in armoring implementations against side-channel attacks and fault injection attacks. One of the most common ways to construct LCP of codes is to use Euclidean linear…

Information Theory · Computer Science 2017-07-28 Claude Carlet , Sihem Mesnager , Chunming Tang , Yanfeng Qi

Self-dual and complementary dual cyclic/abelian codes over finite fields form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, abelian codes…

Rings and Algebras · Mathematics 2019-01-03 Somphong Jitman , San Ling

This paper contributes to construct double circulant self-dual codes by sextic cyclotomy. Generator matrixes of a family of pure double circulant codes and a family of double circulant codes with boundary are formed from sextic cyclotomic…

Information Theory · Computer Science 2020-06-16 Tongjiang Yan , Tao Wang , Wenpeng Gao , Xvbo Zhao

For any different odd primes $\ell$ and $p$, structure of constacyclic codes of length $2\ell^mp^n$ over a finite field $\mathbb F_q$ of characteritic $p$ and their duals is established in term of their generator polynomials. Among other…

Information Theory · Computer Science 2014-06-10 Bocong Chen , Hai Q. Dinh , Hongwei Liu

We study trace codes with defining set $L,$ a subgroup of the multiplicative group of an extension of degree $m$ of the alphabet ring $\mathbb{F}_3+u\mathbb{F}_3+u^{2}\mathbb{F}_{3},$ with $u^{3}=1.$ These codes are abelian, and their…

Information Theory · Computer Science 2016-12-06 Minjia Shi , Daitao Huang , Patrick Sole

Self-dual MDS and NMDS codes over finite fields are linear codes with significant combinatorial and cryptographic applications. In this paper, firstly, we investigate the duality properties of generalized twisted Reed-Solomon (abbreviated…

Information Theory · Computer Science 2022-02-24 Guanmin Guo , Ruihu Li , Yang Liu , Hao Song

Subfield codes of linear codes over finite fields have recently received much attention. Some of these codes are optimal and have applications in secrete sharing, authentication codes and association schemes. In this paper, the $q$-ary…

Information Theory · Computer Science 2023-03-08 Li Xu , Cuiling Fan , Sihem Mesnager , Rong Luo , Haode Yan

We study the variation of the trace of the Frobenius endomorphism associated to a cyclic trigonal curve of genus g over a field of q elements as the curve varies in an irreducible component of the moduli space. We show that for q fixed and…

Number Theory · Mathematics 2010-06-17 Alina Bucur , Chantal David , Brooke Feigon , Matilde Lalín

The results of J. F. Qiann et al. [4] on $(1-\gamma)$-cyclic codes over finite chain rings of nilpotency index 2 are extended to $(1-\gamma^e)$-cyclic codes over finite chain rings of arbitrary nilpotency index $e+1$. The Gray map is…

Rings and Algebras · Mathematics 2009-10-02 Somphong Jitman , Patanee Udomkavanich

In this work, we study codes over the ring R_{k,m}=F_2[u,v]/<u^{k},v^{m},uv-vu>, which is a family of Frobenius, characteristic 2 extensions of the binary field. We introduce a distance and duality preserving Gray map from R_{k,m} to…

Information Theory · Computer Science 2014-06-06 Nesibe Tufekci , Bahattin Yildiz

A linear code is called an MDS self-dual code if it is both an MDS code and a self-dual code with respect to the Euclidean inner product. The parameters of such codes are completely determined by the code length. In this paper, we consider…

Information Theory · Computer Science 2020-05-26 Weijun Fang , Jun Zhang , Shu-Tao Xia1 , Fang-Wei Fu

We derive the spectral domain properties of two-dimensional (2-D) $(\lambda_1, \lambda_2)$-constacyclic codes over $\mathbb{F}_q$ using the 2-D finite field Fourier transform (FFFT). Based on the spectral nulls of 2-D $(\lambda_1,…

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

In this paper we will study cyclic codes over some special rings: F_{q}[u]/(u^{i}), F_{q}[u_1,...u_{i}]/(u_1^2,u_2^2,...,u_{i}^2, u_1 u_2 - u_2 u_1,...,u_{i}u_{j} - u_{j}u_{i},...), F_{q}[u,v]/(u^{i},v^{j},uv-vu), q=p^{r}, where p is a…

Information Theory · Computer Science 2013-02-18 Cristina Flaut

There is a one-to-one correspondence between $\ell$-quasi-cyclic codes over a finite field $\mathbb F_q$ and linear codes over a ring $R = \mathbb F_q[Y]/(Y^m-1)$. Using this correspondence, we prove that every $\ell$-quasi-cyclic self-dual…

Information Theory · Computer Science 2012-01-31 Sunghyu Han , Jon-Lark Kim , Heisook Lee , Yoonjin Lee
‹ Prev 1 8 9 10 Next ›