Sciweavers

ISITA
2010
13 years 2 months ago
Approximating discrete probability distributions with causal dependence trees
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...
Christopher J. Quinn, Todd P. Coleman, Negar Kiyav...
ISITA
2010
13 years 2 months ago
Information reconciliation for QKD with rate-compatible non-binary LDPC codes
We study information reconciliation (IR) scheme for the quantum key distribution (QKD) protocols. The IR for the QKD can be considered as the asymmetric Slepian-Wolf problem, which...
Kenta Kasai, Ryutaroh Matsumoto, Kohichi Sakaniwa
ISITA
2010
13 years 2 months ago
Lattice-reduction aided HNN for vector precoding
In this paper we propose a modication of the Hopeld neural networks for vector precoding, based on Lenstra, Lenstra, and Lov`asz lattice basis reduction. This precoding algorithm c...
Vesna Gardasevic, Ralf R. Müller, Daniel J. R...
ISITA
2010
13 years 2 months ago
Directed information and the NRL Network Pump
The NRL Network Pump R , or Pump, is a standard for mitigating covert channels that arise in a multi-level secure (MLS) system when a high user (HU) sends acknowledgements to a low...
Siva K. Gorantla, Sachin Kadloor, Todd P. Coleman,...
ISITA
2010
13 years 2 months ago
Using synchronization bits to boost compression by substring enumeration
A new lossless data compression technique called compression via substring enumeration (CSE) has recently been introduced. It has been observed that CSE achieves lower performance ...
Danny Dubé