585 research outputs found
Covert channel detection using Information Theory
This paper presents an information theory based detection framework for
covert channels. We first show that the usual notion of interference does not
characterize the notion of deliberate information flow of covert channels. We
then show that even an enhanced notion of "iterated multivalued interference"
can not capture flows with capacity lower than one bit of information per
channel use. We then characterize and compute the capacity of covert channels
that use control flows for a class of systems.Comment: In Proceedings SecCo 2010, arXiv:1102.516
Operational Rate-Distortion Performance of Single-source and Distributed Compressed Sensing
We consider correlated and distributed sources without cooperation at the
encoder. For these sources, we derive the best achievable performance in the
rate-distortion sense of any distributed compressed sensing scheme, under the
constraint of high--rate quantization. Moreover, under this model we derive a
closed--form expression of the rate gain achieved by taking into account the
correlation of the sources at the receiver and a closed--form expression of the
average performance of the oracle receiver for independent and joint
reconstruction. Finally, we show experimentally that the exploitation of the
correlation between the sources performs close to optimal and that the only
penalty is due to the missing knowledge of the sparsity support as in (non
distributed) compressed sensing. Even if the derivation is performed in the
large system regime, where signal and system parameters tend to infinity,
numerical results show that the equations match simulations for parameter
values of practical interest.Comment: To appear in IEEE Transactions on Communication
Exact Performance Analysis of the Oracle Receiver for Compressed Sensing Reconstruction
A sparse or compressible signal can be recovered from a certain number of
noisy random projections, smaller than what dictated by classic Shannon/Nyquist
theory. In this paper, we derive the closed-form expression of the mean square
error performance of the oracle receiver, knowing the sparsity pattern of the
signal. With respect to existing bounds, our result is exact and does not
depend on a particular realization of the sensing matrix. Moreover, our result
holds irrespective of whether the noise affecting the measurements is white or
correlated. Numerical results show a perfect match between equations and
simulations, confirming the validity of the result.Comment: To be published in ICASSP 2014 proceeding
Source Coding with Side Information at the Decoder and Uncertain Knowledge of the Correlation
International audienceThis paper considers the problem of lossless source coding with side information at the decoder, when the correlation model between the source and the side information is uncertain. Four parametrized models representing the correlation between the source and the side information are introduced. The uncertainty on the correlation appears through the lack of knowledge on the value of the parameters. For each model, we propose a practical coding scheme based on non-binary Low Density Parity Check Codes and able to deal with the parameter uncertainty. At the encoder, the choice of the coding rate results from an information theoretical analysis. Then we propose decoding algorithms that jointly estimate the source vector and the parameters. As the proposed decoder is based on the Expectation-Maximization algorithm, which is very sensitive to initialization, we also propose a method to produce first a coarse estimate of the parameters
Codage Distribué dans des Réseaux de Capteurs avec Connaissance Incertaine des Corrélations
National audienceCet article aborde le problème du codage d'une source X avec information adjacente Y disponible uniquement au décodeur dans le cas où P(Y|X) est mal connue au décodeur
Complementary Graph Entropy, AND Product, and Disjoint Union of Graphs
In the zero-error Slepian-Wolf source coding problem, the optimal rate is
given by the complementary graph entropy of the characteristic
graph. It has no single-letter formula, except for perfect graphs, for the
pentagon graph with uniform distribution , and for their disjoint union.
We consider two particular instances, where the characteristic graphs
respectively write as an AND product , and as a disjoint union
. We derive a structural result that equates and up to a multiplicative constant,
which has two consequences. First, we prove that the cases where
and can be
linearized coincide. Second, we determine in cases where it was
unknown: products of perfect graphs; and when is a perfect
graph, using Tuncel et al.'s result for . The
graphs in these cases are not perfect in general
Zero-Error Coding for Computing with Encoder Side-Information
We study the zero-error source coding problem in which an encoder with Side
Information (SI) transmits source symbols to a decoder. The decoder
has SI and wants to recover where are deterministic. We
exhibit a condition on the source distribution and that we call "pairwise
shared side information", such that the optimal rate has a single-letter
expression. This condition is satisfied if every pair of source symbols "share"
at least one SI symbol for all output of . It has a practical
interpretation, as models a request made by the encoder on an image ,
and corresponds to the type of request. It also has a graph-theoretical
interpretation: under "pairwise shared side information" the characteristic
graph can be written as a disjoint union of OR products. In the case where the
source distribution is full-support, we provide an analytic expression for the
optimal rate. We develop an example under "pairwise shared side information",
and we show that the optimal coding scheme outperforms several strategies from
the literature
L’ignorance du droit dans la doctrine civiliste des XIIe-XIIIe siècles
Le thème de l’ignorance du droit, qui constitue une des questions récurrentes de l’histoire du droit occidental, a déjà fait l’objet de plusieurs études consacrées, pour la plupart, au statut de l’erreur en droit romain. Plus rares sont en revanche les historiens qui se sont penchés sur la place de l’ignorantia juris dans la doctrine médiévale. Divers travaux, traitant de l’histoire de la responsabilité, ont certes abordé le problème des conséquences juridiques de l’erreur, envisagées soit du..
- …