Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
901
On Lattices, Learning with Errors, Random Linear Codes, and Cryptography
- In STOC
, 2005
"... Our main result is a reduction from worst-case lattice problems such as SVP and SIVP to a certain learning problem. This learning problem is a natural extension of the ‘learning from parity with error’ problem to higher moduli. It can also be viewed as the problem of decoding from a random linear co ..."
Abstract
-
Cited by 364 (6 self)
- Add to MetaCart
Our main result is a reduction from worst-case lattice problems such as SVP and SIVP to a certain learning problem. This learning problem is a natural extension of the ‘learning from parity with error’ problem to higher moduli. It can also be viewed as the problem of decoding from a random linear
Visual Cryptography
- A PRELIMINARY VERSION OF THIS PAPER APPEARED IN EUROCRYPT 94.
"... In this paper we consider a new type of cryptographic scheme, which can decode concealed images without any cryptographic computations. The scheme is perfectly secure and very easy to implement. We extend it into a visual variant ofthek out of n secret sharing problem, in which a dealer provides a t ..."
Abstract
-
Cited by 327 (4 self)
- Add to MetaCart
In this paper we consider a new type of cryptographic scheme, which can decode concealed images without any cryptographic computations. The scheme is perfectly secure and very easy to implement. We extend it into a visual variant ofthek out of n secret sharing problem, in which a dealer provides a
Decoding in
"... The growing demand for high quality compressed video has led to an increasing need for real-time MPEG-2 decoding. With the widespread availability of multiprocessors, a parallel software implementation provides an effective solution to the decoding problem. We present a parallel decoder for the M ..."
Abstract
- Add to MetaCart
for the MPEG-2 standard, implemented on both centralized and distributed shared memory machines. The goal of this work is to provide an all-software solution for real-time, high-quality video decoding and to investigate the important properties of this application as they pertain to multiprocessors systems
Energy-Efficient Antenna Sharing and Relaying for Wireless Networks
, 2000
"... We develop energy-efficient transmission protocols for wireless networks that exploit spatial diversity created by antenna sharing: coordinated transmission and/or processing by several distributed radios. We focus on single-user transmission and examine several possibilities for the strategy employ ..."
Abstract
-
Cited by 135 (6 self)
- Add to MetaCart
We develop energy-efficient transmission protocols for wireless networks that exploit spatial diversity created by antenna sharing: coordinated transmission and/or processing by several distributed radios. We focus on single-user transmission and examine several possibilities for the strategy
Low-density parity-check codes based on finite geometries: A rediscovery and new results
- IEEE Trans. Inform. Theory
, 2001
"... This paper presents a geometric approach to the construction of low-density parity-check (LDPC) codes. Four classes of LDPC codes are constructed based on the lines and points of Euclidean and projective geometries over finite fields. Codes of these four classes have good minimum distances and thei ..."
Abstract
-
Cited by 186 (8 self)
- Add to MetaCart
and their Tanner graphs have girth T. Finite-geometry LDPC codes can be decoded in various ways, ranging from low to high decoding complexity and from reasonably good to very good performance. They perform very well with iterative decoding. Furthermore, they can be put in either cyclic or quasi-cyclic form
Mixed state entanglement and quantum error correction
- Phys. Rev., A
, 1996
"... Entanglement purification protocols (EPP) and quantum errorcorrecting codes (QECC) provide two ways of protecting quantum states from interaction with the environment. In an EPP, perfectly entangled pure states are extracted, with some yield D, from a bipartite mixed state M; with a QECC, an arbitra ..."
Abstract
-
Cited by 185 (7 self)
- Add to MetaCart
, an arbitrary quantum state |ξ〉 can be transmitted at some rate Q through a noisy channel χ without degradation. We prove that an EPP involving one-way classical communication and acting on mixed state ˆ M(χ) (obtained by sharing halves of EPR pairs through a channel χ) yields a QECC on χ with rate Q = D
The Use of Context in Large Vocabulary Speech Recognition
, 1995
"... decide which contexts are similar and can share parameters. A key feature of this approach is that it allows the construction of models which are dependent upon contextual effects occurring across word boundaries. The use of cross word context dependent models presents problems for conventional dec ..."
Abstract
-
Cited by 157 (0 self)
- Add to MetaCart
decide which contexts are similar and can share parameters. A key feature of this approach is that it allows the construction of models which are dependent upon contextual effects occurring across word boundaries. The use of cross word context dependent models presents problems for conventional
Locally Updatable and Locally Decodable Codes
, 2013
"... We introduce the notion of locally updatable and locally decodable codes (LULDCs). While, intuitively, updatability and error-correction seem to be contrasting goals, we show that for a suitable, yet meaningful, metric (which we call the Prefix Hamming metric), one can construct such codes. Informal ..."
Abstract
-
Cited by 9 (0 self)
- Add to MetaCart
of the codeword). We first construct binary LULDCs for messages in {0, 1} k with constant rate, update locality of O(log 2 k), and read locality of O(k ɛ) for any constant ɛ < 1. Next, we consider the case where the encoder and decoder share a secret state and the adversary is computationally bounded. Here too
Degrees of freedom for MIMO interference channel
- IEEE Transactions on Information Theory
, 2007
"... Abstract — We show that the exact number of spatial degrees of freedom for a two user nondegenerate (full rank channel matrices) MIMO Gaussian interference channel with M1,M2 (respectively) antennas at transmitters 1, 2 and N1, N2 antennas at the corresponding receivers, and perfect channel knowl-ed ..."
Abstract
-
Cited by 164 (32 self)
- Add to MetaCart
the combination of zero forcing, dirty paper coding, and successive decoding schemes is shown to achieve more degrees of freedom than are possible with spatial zero forcing [1] alone. We also study a share-and-transmit scheme and show how the gains of transmitter cooperation are entirely offset by the cost
Sequential Decoder at the Primary User
"... Interference-free spectrum sharing using a sequential decoder at the primary user This document has been downloaded from Chalmers Publication Library (CPL). It is the author´s version of a work that was accepted for publication in: ..."
Abstract
- Add to MetaCart
Interference-free spectrum sharing using a sequential decoder at the primary user This document has been downloaded from Chalmers Publication Library (CPL). It is the author´s version of a work that was accepted for publication in:
Results 1 - 10
of
901
