57,474 research outputs found
Gossip Codes for Fingerprinting: Construction, Erasure Analysis and Pirate Tracing
This work presents two new construction techniques for q-ary Gossip codes
from tdesigns and Traceability schemes. These Gossip codes achieve the shortest
code length specified in terms of code parameters and can withstand erasures in
digital fingerprinting applications. This work presents the construction of
embedded Gossip codes for extending an existing Gossip code into a bigger code.
It discusses the construction of concatenated codes and realisation of erasure
model through concatenated codes.Comment: 28 page
Optimal sequential fingerprinting: Wald vs. Tardos
We study sequential collusion-resistant fingerprinting, where the
fingerprinting code is generated in advance but accusations may be made between
rounds, and show that in this setting both the dynamic Tardos scheme and
schemes building upon Wald's sequential probability ratio test (SPRT) are
asymptotically optimal. We further compare these two approaches to sequential
fingerprinting, highlighting differences between the two schemes. Based on
these differences, we argue that Wald's scheme should in general be preferred
over the dynamic Tardos scheme, even though both schemes have their merits. As
a side result, we derive an optimal sequential group testing method for the
classical model, which can easily be generalized to different group testing
models.Comment: 12 pages, 10 figure
MCViNE -- An object oriented Monte Carlo neutron ray tracing simulation package
MCViNE (Monte-Carlo VIrtual Neutron Experiment) is a versatile Monte Carlo
(MC) neutron ray-tracing program that provides researchers with tools for
performing computer modeling and simulations that mirror real neutron
scattering experiments. By adopting modern software engineering practices such
as using composite and visitor design patterns for representing and accessing
neutron scatterers, and using recursive algorithms for multiple scattering,
MCViNE is flexible enough to handle sophisticated neutron scattering problems
including, for example, neutron detection by complex detector systems, and
single and multiple scattering events in a variety of samples and sample
environments. In addition, MCViNE can take advantage of simulation components
in linear-chain-based MC ray tracing packages widely used in instrument design
and optimization, as well as NumPy-based components that make prototypes useful
and easy to develop. These developments have enabled us to carry out detailed
simulations of neutron scattering experiments with non-trivial samples in
time-of-flight inelastic instruments at the Spallation Neutron Source. Examples
of such simulations for powder and single-crystal samples with various
scattering kernels, including kernels for phonon and magnon scattering, are
presented. With simulations that closely reproduce experimental results,
scattering mechanisms can be turned on and off to determine how they contribute
to the measured scattering intensities, improving our understanding of the
underlying physics.Comment: 34 pages, 14 figure
Dynamic Traitor Tracing for Arbitrary Alphabets: Divide and Conquer
We give a generic divide-and-conquer approach for constructing
collusion-resistant probabilistic dynamic traitor tracing schemes with larger
alphabets from schemes with smaller alphabets. This construction offers a
linear tradeoff between the alphabet size and the codelength. In particular, we
show that applying our results to the binary dynamic Tardos scheme of Laarhoven
et al. leads to schemes that are shorter by a factor equal to half the alphabet
size. Asymptotically, these codelengths correspond, up to a constant factor, to
the fingerprinting capacity for static probabilistic schemes. This gives a
hierarchy of probabilistic dynamic traitor tracing schemes, and bridges the gap
between the low bandwidth, high codelength scheme of Laarhoven et al. and the
high bandwidth, low codelength scheme of Fiat and Tassa.Comment: 6 pages, 1 figur
Dynamic Tardos Traitor Tracing Schemes
We construct binary dynamic traitor tracing schemes, where the number of
watermark bits needed to trace and disconnect any coalition of pirates is
quadratic in the number of pirates, and logarithmic in the total number of
users and the error probability. Our results improve upon results of Tassa, and
our schemes have several other advantages, such as being able to generate all
codewords in advance, a simple accusation method, and flexibility when the
feedback from the pirate network is delayed.Comment: 13 pages, 5 figure
- …