In [8], the authors formulate new coset bounds for algebraic geometric codes. The bounds give improved lower bounds for the minumum distance of algebraic geometric codes as well a...
We propose new data structures for navigation in sequences of balanced parentheses, a standard tool for representing compressed trees. The most striking property of our approach is...
This paper presents and evaluates gFPC, a self-tuning implementation of the FPC compression algorithm for double-precision floating-point data. gFPC uses a genetic algorithm to re...
In this note, we characterize the Grassmann embedding of H(q), q even, as the unique full embedding of H(q) in PG(12, q) for which each ideal line of H(q) is contained in a plane....
A. De Wispelaere, Joseph A. Thas, Hendrik Van Mald...
We provide a stronger definition of anonymity in the context of shared symmetric key primitives, and show that existing schemes do not provide this level of anonymity. A new schem...