Mar 29, 2013 · In this paper, we show an upper bound of O((pq)^{0.625n+0.125}) for the size of any matching family in \mathbb{Z}_{pq}^n, where p and q are two distinct primes.

An upper bound of $O((pq)^{0.625n+0.125})$ is shown for the size of any matching family in $\mathbb{Z}_{pq}^n$, where $p$ and $q$ are two distinct primes.

Abstract—Matching families are one of the major ingredients in the construction of locally decodable codes (LDCs) and the best.

In this paper, we show an upper bound of for the size of any matching family in. , where and are two distinct primes. Our bound is valid when is a constant,. , ...

In this paper, we show an upper bound of $O((pq)^{0.625n+0.125})$ for the size of any matching family in $\mathbb{Z}_{pq}^n$, where $p$ and $q$ are two distinct ...

Jan 6, 2013 · In this paper, we show an upper bound of $O((pq)^{0.625n+0.125})$ for the size of any matching family in $\mathbb{Z}_{pq}^n$, where $p$ and $q$ ...

Table 1 lists the known and new upper bounds on MV families. Theorem 1. For all m ≥ 2,n ≥ 1 we have. MV(m, n, q) ≤ qO(q log q)mn/2. Hence, Theorem 1 ...

Apr 17, 2013 · We prove new upper bounds on the size of families of vectors in \Z_m^n$\Z_m^n$ with restricted modular inner products, when m is a large integer.