中文
相关论文

相关论文: On $(n,\sigma)-$equivalence relation between skew …

200 篇论文

In this article, we construct new non-binary quantum codes from skew constacyclic codes over finite commutative non-chain ring $\mathcal{R}= \mathbb{F}_{p^m}[v]/\langle v^3 =v \rangle$ where $p$ is an odd prime and $m \geq 1$. In order to…

信息论 · 计算机科学 2020-10-15 Ram Krishna Verma , Om Prakash , Ashutosh Singh

We study constacyclic codes, of length $np^s$ and $2np^s$, that are generated by the polynomials $(x^n + \gamma)^{\ell}$ and $(x^n - \xi)^i(x^n + \xi)^j$\ respectively, where $x^n + \gamma$, $x^n - \xi$ and $x^n + \xi$ are irreducible over…

信息论 · 计算机科学 2009-06-23 Hakan Ozadam , Ferruh Ozbudak

Multi-dimensional cyclic code is a natural generalization of cyclic code. In an earlier paper we explored two-dimensional constacyclic codes over finite fields. Following the same technique, here we characterize the algebraic structure of…

信息论 · 计算机科学 2022-01-05 Swati Bhardwaj , Madhu Raka

The cyclic sieving phenomenon provides a link between a polynomial analogue of Gauss congruence known as $q$-Gauss congruence, and a combinatorial analogue of Gauss congruence based on sequences of cyclic group actions. We strengthen this…

组合数学 · 数学 2024-12-24 Fern Gossow

We show that the recently formulated Equivalence Principle (EP) implies a basic cocycle condition both in Euclidean and Minkowski spaces, which holds in any dimension. This condition, that in one-dimension is sufficient to fix the…

高能物理 - 理论 · 物理学 2009-10-31 Gaetano Bertoldi , Alon E. Faraggi , Marco Matone

Let $\mathbb{F}_{p^m}$ be a finite field of cardinality $p^m$ where $p$ is an odd prime, $n$ be a positive integer satisfying ${\rm gcd}(n,p)=1$, and denote $R=\mathbb{F}_{p^m}[u]/\langle u^e\rangle$ where $e\geq 4$ be an even integer. Let…

信息论 · 计算机科学 2018-10-09 Yuan Cao , Yonglin Cao , Hai Q. Dinh , Fang-Wei Fu , Jian Gao , Songsak Sriboonchitta

Let $\mathbb{F}_{q}$ be a finite field of cardinality $q$, $R=\mathbb{F}_{q}[u]/\langle u^4\rangle=\mathbb{F}_{q}+u\mathbb{F}_{q}+u^2\mathbb{F}_{q}+u^3\mathbb{F}_{q}$ $(u^4=0)$ which is a finite chain ring, and $n$ be a positive integer…

信息论 · 计算机科学 2015-11-10 Yuan Cao , Yonglin Cao , Jian Gao

We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the obtained codes share most properties of cyclic codes. Since…

环与代数 · 数学 2016-08-16 Delphine Boucher , Willi Geiselmann , Félix Ulmer

Using the unfolding method given in \cite{HL}, we prove the conjectures on sign-coherence and a recurrence formula respectively of ${\bf g}$-vectors for acyclic sign-skew-symmetric cluster algebras. As a following consequence, the…

表示论 · 数学 2017-04-27 Peigen Cao , Min Huang , Fang Li

We revisit classical gradient characterizations of quasiconvexity and provide corrected proofs that close gaps in earlier arguments. For the differentiable case of $\sigma$-quasiconvexity, we establish the full equivalence between several…

最优化与控制 · 数学 2025-11-27 Nguyen Xuan Duy Bao , Nguyen Mau Nam

A permutation statistic $\operatorname{st}$ is said to be shuffle-compatible if the distribution of $\operatorname{st}$ over the set of shuffles of two disjoint permutations $\pi$ and $\sigma$ depends only on $\operatorname{st}\pi$,…

组合数学 · 数学 2023-09-29 Jinting Liang , Bruce E. Sagan , Yan Zhuang

The notion of pseudocyclic association scheme is generalized to the non-commutative case. It is proved that any pseudocyclic scheme the rank of which is much more than the valency is the scheme of a Frobenius group and is uniquely…

组合数学 · 数学 2015-05-07 M. E. Muzychuk , I. N. Ponomarenko

For any prime $p$, $\lambda$-constacyclic codes of length $p^s$ over ${\cal R}=\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}$ are precisely the ideals of the local ring ${\cal R}_{\lambda}=\frac{{\cal R}[x]}{\left\langle x^{p^s}-\lambda…

信息论 · 计算机科学 2016-12-13 Hongwei Liu , Maouche Youcef

In this paper, the investigation on the algebraic structure of the ring $\frac{\mathbb{F}_q[v]}{\langle\,v^q-v\,\rangle}$ and the description of its automorphism group, enable to study the algebraic structure of codes and their dual over…

信息论 · 计算机科学 2019-02-28 Joël Kabore , Alexandre Fotue-Tabue , Kenza Guenda , Mohammed E. Charkani

In this paper, we build the unfolding approach from acyclic sign-skew-symmetric matrices of finite rank to skew-symmetric matrices of infinite rank, which can be regard as an improvement of that in the skew-symmetrizable case. Using this…

表示论 · 数学 2016-11-29 Min Huang , Fang Li

In this paper, we study a family of constacyclic BCH codes over $\mathbb{F}_{q^2}$ of length $n=\frac{q^{2m}-1}{q+1}$, where $q$ is a prime power, and $m\geq2$ an even integer. The maximum design distance of narrow-sense Hermitian…

信息论 · 计算机科学 2020-07-28 X. Zhao , X. Li , Q. Wang , T. Yan

Constacyclic codes over finite fields are a family of linear codes and contain cyclic codes as a subclass. Constacyclic codes are related to many areas of mathematics and outperform cyclic codes in several aspects. Hence, constacyclic codes…

信息论 · 计算机科学 2022-08-29 Zhonghua Sun , Cunsheng Ding , Xiaoqiang Wang

Self-dual cyclic codes form an important class of linear codes. It has been shown that there exists a self-dual cyclic code of length $n$ over a finite field if and only if $n$ and the field characteristic are even. The enumeration of such…

信息论 · 计算机科学 2017-07-19 Supawadee Prugsapitak , Somphong Jitman

The study of permutation automorphism groups of cyclic codes is a central topic in algebraic coding theory. A cyclic code over $\mathbb{F}_q$ is called irreducible if its check polynomial is irreducible over $\mathbb{F}_q$. Such a code is…

组合数学 · 数学 2026-03-03 Tao Feng , Henk D. L. Hollmann , Weicong Li , Qing Xiang

Given a finite field F_q and a positive integer n, a flag is a sequence of nested F_q-subspaces of a vector space F_q^n and a flag code is a nonempty collection of flags. The projected codes of a flag code are the constant dimension codes…

信息论 · 计算机科学 2023-11-13 Miguel Ángel Navarro-Pérez , Xaro Soler-Escrivà