English
Related papers

Related papers: On depth spectra of constacyclic codes

200 papers

Let $p$ be an odd prime and $r,s,m$ be positive integers. In this study, we initiate our exploration by delving into the intricate structure of all repeated-root cyclic codes and their duals with a length of $2^rp^s$ over the finite field…

Information Theory · Computer Science 2024-06-21 Lanqiang Li , Ziwen Cao , Tingting Wu , Li Liu

The anti-forcing number of a perfect matching $M$ of a graph $G$ is the minimal number of edges not in $M$ whose removal make $M$ as a unique perfect matching of the resulting graph. The anti-forcing spectrum of $G$ is the set of…

Combinatorics · Mathematics 2014-11-21 Kai Deng , Heping Zhang

Let $\mathbb{F}_p$ be a finite field and $u$ be an indeterminate. This article studies $(1-2u^k)$-constacyclic codes over the ring $\mathcal{R}=\mathbb{F}_p+u\mathbb{F}_p+u^2\mathbb{F}_p+u^{3}\mathbb{F}_{p}+\cdots+u^{k}\mathbb{F}_{p}$ where…

Information Theory · Computer Science 2019-04-18 Zahid Raza , Amrina Rana

An equivalence relation called isometry is introduced to classify constacyclic codes over a finite field; the polynomial generators of constacyclic codes of length $\ell^tp^s$ are characterized, where $p$ is the characteristic of the finite…

Information Theory · Computer Science 2013-01-04 Bocong Chen , Yun Fan , Liren Lin , Hongwei Liu

Classical crystals are solid materials containing arbitrarily long periodic repetitions of a single motif. In this paper, we study the maximal possible repetition of the same motif occurring in beta-integers -- one dimensional models of…

Combinatorics · Mathematics 2013-02-12 L. Balková , K. Klouda , E. Pelantová

For every integer $r\ge3$ and every $\eps>0$ we construct a graph with maximum degree $r-1$ whose circular total chromatic number is in the interval $(r,r+\eps)$. This proves that (i) every integer $r\ge3$ is an accumulation point of the…

Combinatorics · Mathematics 2013-02-14 Mohammad Ghebleh

In this paper, several families of irreducible constacyclic codes over finite fields and their duals are studied. The weight distributions of these irreducible constacyclic codes and the parameters of their duals are settled. Several…

Information Theory · Computer Science 2022-07-06 Zhonghua Sun , Xiaoqiang Wang , Cunsheng Ding

An $n$-bit Gray code is a sequence of all $n$-bit strings such that consecutive strings differ in a single bit. It is well-known that given $\alpha,\beta\in\{0,1\}^n$, an $n$-bit Gray code between $\alpha$ and $\beta$ exists iff the Hamming…

Discrete Mathematics · Computer Science 2017-03-07 Tomáš Dvořák , Petr Gregor , Václav Koubek

In this survey paper on commutative ring spectra we present some basic features of commutative ring spectra and discuss model category structures. As a first interesting class of examples of such ring spectra we focus on (commutative)…

Algebraic Topology · Mathematics 2017-10-09 Birgit Richter

We continue the investigation of the existence of absolutely continuous (a.c.) spectrum for the discrete Schr\"odinger operator $\Delta+V$ on $\ell^2(\Z^d)$, in dimensions $d\geq 2$, for potentials $V$ satisfying the long range condition…

Functional Analysis · Mathematics 2022-01-25 Sylvain Golénia , Marc-Adrien Mandich

One-loop scattering amplitudes in string theories involve configuration-space integrals over genus-one surfaces with coefficients of Kronecker-Eisenstein series in the integrand. A conjectural genus-one basis of integrands under Fay…

High Energy Physics - Theory · Physics 2024-05-28 Carlos Rodriguez , Oliver Schlotterer , Yong Zhang

A rateless code encodes a finite length information word into an infinitely long codeword such that longer prefixes of the codeword can tolerate a larger fraction of errors. A rateless code achieves capacity for a family of channels if, for…

Information Theory · Computer Science 2014-06-03 Benny Applebaum , Liron David , Guy Even

We consider uniform random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$, in the limit of large $n$. Since in unconstrained uniform random permutations most of the indices are in cycles of…

Probability · Mathematics 2018-12-21 Volker Betz , Helge Schäfer , Dirk Zeindler

For a ring R, denote by Spec^R_kappa(Gamma) the kappa-spectrum of the Gamma-invariant of strongly uniform right R-modules. Recent realization techniques of Goodearl and Wehrung show that Spec^R_{aleph_1}(Gamma) is full for suitable von…

Logic · Mathematics 2007-05-23 Saharon Shelah , Jan Trlifaj

In string theories, one-loop scattering amplitudes are characterized by integrals over genus-one surfaces using the Kronecker-Eisenstein series. A recent methodology proposed a genus-one basis formed from products of these series of chain…

High Energy Physics - Theory · Physics 2024-05-28 Yong Zhang

Let $\Gamma$ be a rooted tree and let $t$ be a positive integer. We study algebraic invariants and properties of the path ideal generated by monomial corresponding to paths of length $(t-1)$ in $\Gamma$. In particular, we give a recursive…

Commutative Algebra · Mathematics 2011-06-07 Rachelle R. Bouchat , Huy Tai Ha , Augustine O'Keefe

For a countable ultrahomogeneous graph G let P(G) denote the collection of domains of subgraphs of G isomorphic to G. The order types of maximal chains in the set P(G) U {\o} ordered by the inclusion are characterized as: (I) the order…

Logic · Mathematics 2017-09-26 Milos S. Kurilic , Borisa Kuzeljevic

Let $R=\mathbb{Z}_4+u\mathbb{Z}_4,$ where $\mathbb{Z}_4$ denotes the ring of integers modulo $4$ and $u^2=0$. In the present paper, we introduce a new Gray map from $R^n$ to $\mathbb{Z}_{4}^{2n}.$ We study $(1+2u)$-constacyclic codes over…

Rings and Algebras · Mathematics 2015-04-15 Mohammad Ashraf , Ghulam Mohammad

We study the ring theory of the multiparameter deformations of the quantum Schubert cell algebras obtained from 2-cocycle twists. This is a large family, which extends the Artin-Schelter-Tate algebras of twisted quantum matrices. We…

Rings and Algebras · Mathematics 2012-02-21 Milen Yakimov

Let $\mathcal{G}_{n, \beta^*}$ $(\mathcal{G}^*_{n,\beta^*})$ be the set of all (connected) graphs of order $n$ with fractional matching number $\beta^*$. In this paper, the graphs with maximal spectral radius in $\mathcal{G}_{n,\beta^*}$…

Combinatorics · Mathematics 2023-03-13 Qian-Qian Chen , Ji-Ming Guo
‹ Prev 1 4 5 6 7 8 10 Next ›