相关论文: Consta-dihedral Codes over Finite Fields

This is a survey article on the existence of locally conformally flat(LCF) and self-dual(SD) metrics on various basic 4-manifolds like simply-connected ones or product types

We call a linear code $C$ with length $n$ over a field $F$, a linear complementary equi-dual code, when there exists a linear code $D$ over $F$ such that $D$ is permutation equivalent to $C^\perp$ and $(C,D)$ is a linear complementary pair…

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…

We obtain new uniform upper bounds for the (non necessarily symmetric) tensor rank of the multiplication in the extensions of the finite fields $\F_q$ for any prime or prime power $q\geq2$; moreover these uniform bounds lead to new…

In this paper we introduce self-dual cyclic and quantum codes over Z2^{\alpha} x (Z2 + uZ2)^{\beta}. We determine the conditions for any Z2Z2[u]-cyclic code to be self-dual, that is, C = C^{\perp}. Since the binary image of a…

In this paper, we consider the asymptotic behavior of positive solutions of the biharmonic equation $$ \Delta^2 u = u^p~~~~~~~in ~ B_1 \backslash \{0\}$$ with an isolated singularity, where the punctured ball $B_1 \backslash \{0\} \subset…

We establish that if $d \geq 2k + 6$ and $q$ is odd and sufficiently large with respect to $\alpha \in (0,1)$, then every set $A\subseteq \mathbf{F}_q^d$ of size $|A| \geq \alpha q^d$ will contain an isometric copy of every spherical…

Let $F$ be a totally real field and $n\leq 4$ a natural number. We study the monodromy groups of any $n$-dimensional strictly compatible system $\{\rho_\lambda\}_\lambda$ of $\lambda$-adic representations of $F$ with distinct Hodge-Tate…

In this paper, we study the asymptotic behavior of solutions to a scalar fractional delay differential equations around the equilibrium points. More precise, we provide conditions on the coefficients under which a linear fractional delay…

We construct fermionic conformal field theories (CFTs) whose spectra are characterized by quantum stabilizer codes. We exploit our construction to search for fermionic CFTs with supersymmetry by focusing on quantum stabilizer codes of the…

Let $\Delta\subsetneq\V$ be a proper subset of the vertices $\V$ of the defining graph of an aperiodic shift of finite type $(\Sigma_{A}^{+},\S)$. Let $\Delta_{n}$ be the union of cylinders in $\Sigma_{A}^{+}$ corresponding to the points…

We prove that the representations numbers of a ternary definite integral quadratic form defined over F_q[t], where F_q is a finite field of odd characteristic, determine its integral equivalence class when q is large enough with respect to…

We studied the asymptotic behavior of local solutions for strongly coupled critical elliptic systems near an isolated singularity. For the dimension less than or equal to five we prove that any singular solution is asymptotic to a…

Locally repairable codes (LRCs) have attracted a lot of attention due to their applications in distributed storage systems. In this paper, we provide new constructions of optimal $(2, \delta)$-LRCs over $\mathbb{F}_q$ with flexible…

We characterize constacyclic codes in the spectral domain using the finite field Fourier transform (FFFT) and propose a reduced complexity method for the spectral-domain decoder. Further, we also consider repeated-root constacyclic codes…

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…

In 2011, Guruswami-H{\aa}stad-Kopparty \cite{Gru} showed that the list-decodability of random linear codes is as good as that of general random codes. In the present paper, we further strengthen the result by showing that the…

For $\lambda$ an $n$-th power of a unit in a finite chain ring we prove that $\lambda$-constacyclic repeated-root codes over some finite chain rings are equivalent to cyclic codes. This allows us to simplify the structure of some…

We prove that for every odd $q\geq 3$, any $q$-query binary, possibly non-linear locally decodable code ($q$-LDC) $E:\{\pm1\}^k \rightarrow \{\pm1\}^n$ must satisfy $k \leq \tilde{O}(n^{1-2/q})$. For even $q$, this bound was established in…

We show that (n,2^n) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to undirected graphs. Graph representation reduces the…