Related papers: Generalized Spectral Bound for Quasi-Twisted Codes
The general parametrization of spherically symmetric and asymptotically flat black-hole spacetimes in arbitrary metric theories of gravity was suggested in [3]. The parametrization is based on the continued fraction expansion in terms of…
Cyclic codes over finite fields are widely employed in communication systems, storage devices and consumer electronics, as they have efficient encoding and decoding algorithms. BCH codes, as a special subclass of cyclic codes, are in most…
BCH codes are an interesting class of cyclic codes due to their efficient encoding and decoding algorithms. In the past sixty years, a lot of progress on the study of BCH codes has been made, but little is known about the properties of…
This paper aims to give a further study on quasi-convex subsets in Alexandrov spaces with lower curvature bound which are introduced in [SSW]. We first provide new insights on quasi-convex subsets (Theorem A and Corollary C), and then as…
The convex closure of entropy vectors for quasi-uniform random vectors is the same as the closure of the entropy region. Thus, quasi-uniform random vectors constitute an important class of random vectors for characterizing the entropy…
We obtain an upper bound on the minimal number of points in an $\epsilon$-chain joining two points in a metric space. This generalizes a bound due to Hambly and Kumagai (1999) for the case of resistance metric on certain self-similar…
Quasi-twisted (QT) codes generalize several important families of linear codes, including cyclic, constacyclic, and quasi-cyclic codes. Despite their potential, to the best of our knowledge, there exists no efficient decoding algorithm for…
Binary duadic codes are an interesting subclass of cyclic codes since they have large dimensions and their minimum distances may have a square-root bound. In this paper, we present several families of binary duadic codes of length $2^m-1$…
Let A be a self-adjoint operator on a Hilbert space H. Assume that {\sigma} is an isolated component of the spectrum of A, i.e. dist({\sigma},{\Sigma})=d>0 where {\Sigma}=spec(A)\{\sigma}. Suppose that V is a bounded self-adjoint operator…
This paper improves the antiGriesmer bound for linear anticodes previously established by Chen and Xie (Journal of Algebra, 673 (2025) 304-320). While the original bound required the code length to satisfy $n < q^{k-1}$ and the dual code to…
In this paper, we establish the necessary and sufficient conditions for quasi-cyclic (QC) codes with index even to be symplectic self-orthogonal. Subsequently, we present the lower and upper bounds on the minimum symplectic distances of a…
Here we obtain explicit formulae for bounds on the complex electrical polarizability at a given frequency of an inclusion with known volume that follow directly from the quasistatic bounds of Bergman and Milton on the effective complex…
This paper is concerned with a rate-distortion theory for sequences of i.i.d. random variables with general distribution supported on general sets including manifolds and fractal sets. Manifold structures are prevalent in data science,…
It is proved that if $G$ is a $t$-tough graph of order $n$ and minimum degree $\delta$ with $t>1$ then either $G$ has a cycle of length at least $\min\{n,2\delta+5\}$ or $G$ is the Petersen graph.
We consider the problem of discriminating between two different states of a finite quantum system in the setting of large numbers of copies, and find a closed form expression for the asymptotic exponential rate at which the specified error…
In this work, our main objective is to construct quantum codes from quasi-twisted (QT) codes. At first, a necessary and sufficient condition for Hermitian self-orthogonality of QT codes is introduced by virtue of the Chinese Remainder…
In 1992, Szyld provided a sequence of lower bounds for the spectral radius of a nonnegative matrix $A$, based on the geometric symmetrization of powers of $A$. In 1998, Ta\c{s}\c{c}i and Kirkland proved a companion result by giving a…
We consider the weight spectrum of a class of quasi-perfect binary linear codes with code distance 4. For example, extended Hamming code and Panchenko code are the known members of this class. Also, it is known that in many cases Panchenko…
In this short note we revisit the upper bound of the asymptotic least density of covering codes of radius $R$ in $[q]^n$ established by Krivelevich, Sudakov, and Vu. We show that by using a slightly different optimization in their core…
This is a survey on the theory of skew-cyclic codes based on skew-polynomial rings of automorphism type. Skew-polynomial rings have been introduced and discussed by Ore (1933). Evaluation of skew polynomials and sets of (right) roots were…