Related papers: On depth spectra of constacyclic codes

We study long-range percolation on the hierarchical lattice of order $N$, where any edge of length $k$ is present with probability $p_k=1-\exp(-\beta^{-k} \alpha)$, independently of all other edges. For fixed $\beta$, we show that the…

Let $\mathbb{F}_q$ be a finite field with $q$ elements and denote by $\theta : \mathbb{F}_q\to\mathbb{F}_q$ an automorphism of $\mathbb{F}_q$. In this paper, we deal with skew constacyclic codes, that is, linear codes of $\mathbb{F}_q^n$…

We show that for a model complete strongly minimal theory whose pregeometry is flat, the recursive spectrum (SRM($T$)) is either of the form $[0,\alpha)$ for $\alpha\in \omega+2$ or $[0,n]\cup\{\omega\}$ for $n\in \omega$, or $\{\omega\}$,…

Let R be a commutative ring and let Spec(R) denote the collection of prime ideals of R. We define a topology on Spec(R) by using ultrafilters and demonstrate that this topology is identical to the well known patch or constructible topology.…

For a tuple $A=(A_1,\ A_2,\ ...,\ A_n)$ of elements in a unital algebra ${\mathcal B}$ over $\mathbb{C}$, its {\em projective spectrum} $P(A)$ or $p(A)$ is the collection of $z\in \mathbb{C}^n$, or respectively $z\in \mathbb{P}^{n-1}$ such…

In this work, we study the structure of cyclic DNA codes of arbitrary lengths over the ring R=F2+uF2+vF2+uvF2 and establish relations to codes over R1=F2+uF2 by defining a Gray map between R and R1^2 where R1 is the ring with 4 elements.…

We consider Cantor measures on the line, with contraction factor $N^{-1}=p^{-\alpha}$ (where $p$ a positive prime, $\alpha$ a positive integer) and $m$ positive integer digits lying in distinct residue classes modulo $N$. We obtain a…

We first define a new Gray map from $R=\mathbb{Z}_4+u\mathbb{Z}_4$ to $\mathbb{Z}^{2}_{4}$, where $u^2=1$ and study $(1+2u)$-constacyclic codes over $R$. Also of interest are some properties of $(1+2u)$-constacyclic codes over $R$.…

Let $\mathbb{Z}_p$ be the ring of integers modulo a prime number $p$ where $p-1$ is a quadratic residue modulo $p$. This paper presents the study of constacyclic codes over chain rings $\mathcal{R}=\frac{\mathbb{Z}_p[u]}{\langle…

Cyclic codes are the most studied subclass of linear codes and widely used in data storage and communication systems. Many cyclic codes have optimal parameters or the best parameters known. They are divided into simple-root cyclic codes and…

In this article, we establish initially regular sequences on cycles of the form $C_{3n+2}$ for $n\ge 1$, in the sense of \cite{FHM-ini}. These sequences accurately compute the depth of these cycles, completing the case of finding effective…

Let $\beta$ be the functor from Set to CHaus which maps each discrete set X to its Stone-Cech compactification, the set $\beta$ X of ultrafilters on X. Every graph G with vertex set V naturally gives rise to a graph $\beta G$ on the set…

Given a connected graph $R$ on $r$ vertices and a rooted graph $H,$ let $R\{H\}$ be the graph obtained from $r$ copies of $H$ and the graph $R$ by identifying the root of the $i-th$ copy of $H$ with the $i-th$ vertex of $R$. Let…

This paper investigates the application of the theoretical algebraic notion of a separable ring extension, in the realm of cyclic convolutional codes or, more generally, ideal codes. We work under very mild conditions, that cover all…

In this paper, we initiate the study of deterministic PIT for $\Sigma^{[k]}\Pi\Sigma\Pi^{[\delta]}$ circuits over fields of any characteristic, where $k$ and $\delta$ are bounded. Our main result is a deterministic polynomial-time black-box…

For the elements of a Coxeter group, we present a statistic called depth, defined in terms of factorizations of the elements into products of reflections. Depth is bounded above by length and below by the average of length and reflection…

Let $G$ be a graph with adjacency matrix $A(G)$ and let $D(G)$ be the diagonal matrix of the degrees of $G$. For every real $\alpha\in\left[ 0,1\right],$ define the matrix $A_{\alpha}\left(G\right) $ as \[ A_{\alpha}\left(G\right) =\alpha…

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…

Let $R$ be a ring with unity. The graph $\Gamma(R)$ is a graph with vertices as elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if $Ra+Rb=R$. Let $\Gamma_2(R)$ is the subgraph of $\Gamma(R)$ induced by the…

Let $\Lambda_n^k$ denote the class of $(0,1)$ square matrices containing in each row and in each column exactly $k$ 1's. The minimal value of $k,$ for which the behavior of the permanent in $\Lambda_n^k$ is not quite studied, is $k=3.$ We…