Related papers: (Sigma-Delta) Codes
Let $G$ be a finite solvable group, given through a refined consistent polycyclic presentation, and $\alpha$ an automorphism of $G$, given through its images of the generators of $G$. In this paper, we discuss algorithms for computing the…
Let $\mathbb{F}_{p^m}$ be the field containing $p^m$ elements where $p$ is an odd prime and $m \in \mathbb{N}$. In this article, we propose a unified approach to the study of skew constacyclic codes of length $np^s$ over the ring $R_k =…
We introduce the notion of a {\vartheta}-summable Fredholm module over a locally convex dg algebra {\Omega} and construct its Chern character as a cocycle on the entire cyclic complex of {\Omega}, extending the construction of Jaffe,…
These introductory notes are about functional renormalization group equations and some of their applications. It is emphasised that the applicability of this method extends well beyond critical systems, it actually provides us a general…
Cyclic codes are an interesting subclass of linear codes and have been used in consumer electronics, data transmission technologies, broadcast systems, and computer applications due to their efficient encoding and decoding algorithms. In…
Commutative complex numbers of the form u=x+\alpha y+\beta z+\gamma t in 4 dimensions are studied, the variables x, y, z and t being real numbers. Four distinct types of multiplication rules for the complex bases \alpha, \beta and \gamma…
In this paper,we show some $[2n,2n-2,3]$ and $[2n,2n-3,4]$ MDS codes over dihedral codes $F_qD_{2n}$,in the case $n$ is odd and char$F_q$$\nmid$$\lvert G \rvert$ and $F_q$ contains primitive root of exponent $\lvert G \rvert$ i.e $F_q$ is…
F-nomial coefficients encompass among others well-known binomial coefficients or Gaussian coefficients that count subsets of finite set and subspaces of finite vector space respectively. Here, the so called F-cobweb tiling sequences N(a)…
In this paper, we present a method based on contour integration to investigate a class of cyclotomic parametric Ap\'ery-like series. The general term of such series involves a parametric central binomial coefficient, which is defined via…
We consist of first presenting Zeckendorf Theorem with these two versions Fibonacci and Luca. In this document we obtain results on the generalized of the Zeckendorf theorem for Fibonacci numbers (multibonacci). Such results find…
In the usual statistical model of a dense polymer (a single space-filling loop on a lattice) in two dimensions the loop does not cross itself. We modify this by including intersections in which {\em three} lines can cross at the same point,…
In this paper we consider the category of F^\sigma of finite-dimensional representations of a twisted loop algebra corresponding to a finite-dimensional Lie algebra with non-trivial diagram automorphism. Although F^\sigma is not semisimple,…
Cyclic AG-codes $C_L(D,G)$ on the Hermitian curve $H_q$ over $\mathbb{F}_{q^2}$ are constructed such that $G = m(P_2 + \ldots + P_q)$, where $2 \le m \le q-1$ and $\mathrm{supp}(G)$ is the intersection of $H_q$ with a chord $\ell$ minus two…
Professor Cunsheng Ding gave cyclotomic constructions of cyclic codes with length being the product of two primes. In this paper, we study the cyclic codes of length $n=2^e$ and dimension $k=2^{e-1}$. Clearly, Ding's construction is not…
In 1997 the present authors published a review (Ref. BEL97 in the present manuscript) that recapitulated and developed classical theory of Abelian functions realized in terms of multi-dimensional sigma-functions. This approach originated by…
The goal of the paper is two-fold. At first, we attempt to give a survey of some recent applications of symmetric polynomials and divided differences to intersection theory. We discuss: polynomials universally supported on degeneracy loci;…
In this work we resolve conjectures of Beecken, Mitmann and Saxena [BMS13] and Gupta [Gup14], by proving an analog of a theorem of Edelstein and Kelly for quadratic polynomials. As immediate corollary we obtain the first deterministic…
We introduce the first example of algebraically constructed hierarchical quasi-cyclic codes. These codes are built from Reed-Solomon codes using a 1964 construction of superimposed codes by Kautz and Singleton. We show both the number of…
The homogeneous coordinate ring $\mathbb{C}[\operatorname{Gr}(k,n)]$ of the Grassmannian is a cluster algebra, with an additive categorification $\operatorname{CM}C$. Thus every $M\in\operatorname{CM}C$ has a cluster character…
In this paper we define $\mathbb{Z}_{2}\mathbb{Z}_{4}-$Simplex and MacDonald Codes of type $\alpha $ and $\beta $ and we give the covering radius of these codes.