Related papers: On weak isometries of Preparata codes
We establish weighted weak-type bounds for the Bergman projection with respect to Bekoll\'e-Bonami characteristics. We present two proofs of an improved quantitative weak-type $(1,1)$ estimate, as well as sharp weak-type $(p,p)$ bounds for…
We investigate small weight code words of the $p$-ary linear code $\mathcal C_{j,k}(n,q)$ generated by the incidence matrix of $k$-spaces and $j$-spaces of PG$(n,q)$ and its dual, with $q$ a prime power and $0 \leq j < k < n$. Firstly, we…
Given a graph $G$ then a subgraph $H$ is $isometric$ if, for every pair of vertices $u,v$ of $H$, we have $d_H(u,v) = d_G(u,v)$. We say a graph $G$ is $distance\ preserving\ (dp)$ if it has an isometric subgraph of every possible order up…
In this paper we present several classes of asymptotically good concatenated quantum codes and derive lower bounds on the minimum distance and rate of the codes. We compare these bounds with the best-known bound of…
A set $D$ of vertices in a graph $G$ is a dominating set if every vertex of $G$, which is not in $D$, has a neighbor in $D$. A set of vertices $D$ in $G$ is convex (respectively, isometric), if all vertices in all shortest paths…
Linear complementary dual (LCD) codes are linear codes which intersect their dual codes trivially, which have been of interest and extensively studied due to their practical applications in computational complexity and information…
Weak values and measurements have been proposed as means to achieve dramatic enhancements in metrology based on the greatly increased range of possible measurement outcomes. Unfortunately, the very large values of measurement outcomes occur…
In this paper, we establish a common fixed point theorem for two pairs of occasionally weakly compatible single and set-valued maps satisfying a strict contractive condition in a metric space. Our result extends many results existing in the…
Classically, there are two model category structures on coalgebras in the category of chain complexes over a field. In one, the weak equivalences are maps which induce an isomorphism on homology. In the other, the weak equivalences are maps…
We introduce a notion of weak convergence in arbitrary metric spaces. Metric functionals are key in our analysis: weak convergence of sequences in a given metric space is tested against all the metric functionals defined on said space. When…
Let A(q,n,d) denote the maximum size of a q-ary code of length n and distance d. We study the minimum asymptotic redundancy \rho(q,n,d)=n-log_q A(q,n,d) as n grows while q and d are fixed. For any d and q<=d-1, long algebraic codes are…
This paper considers the construction of isodual quasi-cyclic codes. First we prove that two quasi-cyclic codes are permutation equivalent if and only if their constituent codes are equivalent. This gives conditions on the existence of…
In this paper, we introduce a standard generator matrix for mixed-alphabet linear codes over finite chain rings. Furthermore, we show that, when one has a linear complementary pair (LCP) of mixed-alphabet linear codes, both codes are…
As a crucial technique for integrated circuits (IC) test response compaction, $X$-compact employs a special kind of codes called $X$-codes for reliable compressions of the test response in the presence of unknown logic values ($X$s). From a…
In this paper, we propose new coupled codes constructed by overlapping circular spatially-coupled low-density parity-check (SC-LDPC) codes, which show better asymptotic and finite-length decoding performance compared to the conventional…
Recently, binary cyclic codes with parameters $[n,(n\pm1)/2,\geq \sqrt{n}]$ have been a hot topic since their minimum distances have a square-root bound. In this paper, we construct four classes of binary cyclic codes…
We prove that if G is a discrete group that admits a metrically proper action on a finite-dimensional CAT(0) cube complex X, then G is weakly amenable. We do this by constructing uniformly bounded Hilbert space representations for which the…
The maximum size $A_2(8,6;4)$ of a binary subspace code of packet length $v=8$, minimum subspace distance $d=6$, and constant dimension $k=4$ is $257$, where the $2$ isomorphism types are extended lifted maximum rank distance codes. In…
A compact space is said to be weakly Radon-Nikod\'ym if it is homeomorphic to a weak*-compact subset of the dual of a Banach space not containing an isomorphic copy of $\ell_1$. In this work we provide an example of a continuous image of a…
Weak measurement is a novel quantum measurement scheme, which is usually characterized by the weak value formalism. To guarantee the validity of the weak value formalism, the fidelity between the pre-selection and the post-selection should…