171 research outputs found
On 1-factorizations of Bipartite Kneser Graphs
It is a challenging open problem to construct an explicit 1-factorization of
the bipartite Kneser graph , which contains as vertices all -element
and -element subsets of and an edge between any
two vertices when one is a subset of the other. In this paper, we propose a new
framework for designing such 1-factorizations, by which we solve a nontrivial
case where and is an odd prime power. We also revisit two classic
constructions for the case --- the \emph{lexical factorization} and
\emph{modular factorization}. We provide their simplified definitions and study
their inner structures. As a result, an optimal algorithm is designed for
computing the lexical factorizations. (An analogous algorithm for the modular
factorization is trivial.)Comment: We design the first explicit 1-factorization of H(2,q), where q is a
odd prime powe
Quantum fingerprinting
Classical fingerprinting associates with each string a shorter string (its
fingerprint), such that, with high probability, any two distinct strings can be
distinguished by comparing their fingerprints alone. The fingerprints can be
exponentially smaller than the original strings if the parties preparing the
fingerprints share a random key, but not if they only have access to
uncorrelated random sources. In this paper we show that fingerprints consisting
of quantum information can be made exponentially smaller than the original
strings without any correlations or entanglement between the parties: we give a
scheme where the quantum fingerprints are exponentially shorter than the
original strings and we give a test that distinguishes any two unknown quantum
fingerprints with high probability. Our scheme implies an exponential
quantum/classical gap for the equality problem in the simultaneous message
passing model of communication complexity. We optimize several aspects of our
scheme.Comment: 8 pages, LaTeX, one figur
Perfect Secrecy Systems Immune to Spoofing Attacks
We present novel perfect secrecy systems that provide immunity to spoofing
attacks under equiprobable source probability distributions. On the theoretical
side, relying on an existence result for -designs by Teirlinck, our
construction method constructively generates systems that can reach an
arbitrary high level of security. On the practical side, we obtain, via cyclic
difference families, very efficient constructions of new optimal systems that
are onefold secure against spoofing. Moreover, we construct, by means of
-designs for large values of , the first near-optimal systems that are 5-
and 6-fold secure as well as further systems with a feasible number of keys
that are 7-fold secure against spoofing. We apply our results furthermore to a
recently extended authentication model, where the opponent has access to a
verification oracle. We obtain this way novel perfect secrecy systems with
immunity to spoofing in the verification oracle model.Comment: 10 pages (double-column); to appear in "International Journal of
Information Security
Lower bound for the quantum capacity of a discrete memoryless quantum channel
We generalize the random coding argument of stabilizer codes and derive a
lower bound on the quantum capacity of an arbitrary discrete memoryless quantum
channel. For the depolarizing channel, our lower bound coincides with that
obtained by Bennett et al. We also slightly improve the quantum
Gilbert-Varshamov bound for general stabilizer codes, and establish an analogue
of the quantum Gilbert-Varshamov bound for linear stabilizer codes. Our proof
is restricted to the binary quantum channels, but its extension of to l-adic
channels is straightforward.Comment: 16 pages, REVTeX4. To appear in J. Math. Phys. A critical error in
fidelity calculation was corrected by using Hamada's result
(quant-ph/0112103). In the third version, we simplified formula and
derivation of the lower bound by proving p(Gamma)+q(Gamma)=1. In the second
version, we added an analogue of the quantum Gilbert-Varshamov bound for
linear stabilizer code
The Threat of Capital Drain: A Rationale for Public Banks?
This paper yields a rationale for why subsidized public banks may be desirable from a regional perspective in a financially integrated economy. We present a model with credit rationing and heterogeneous regions in which public banks prevent a capital drain from poorer to richer regions by subsidizing local depositors, for example, through a public guarantee. Under some conditions, cooperative banks can perform the same function without any subsidization; however, they may be crowded out by public banks. We also discuss the impact of the political structure on the emergence of public banks in a political-economy setting and the role of interregional mobility
- …