DCC
2010
IEEE
12 years 11 months ago
2010
IEEE
Abstract. Given an algebraic geometry code CL(D, P), the GuruswamiSudan algorithm produces a list of all codewords in CL(D, P) within a specified distance of a received word. The i...
DCC
2010
IEEE
13 years 2 months ago
2010
IEEE
Remote visualization of an arbitrary 2-D planar "cut" from a large volumetric dataset with random access has both gained importance and posed significant challenges over...
DCC
2010
IEEE
13 years 3 months ago
2010
IEEE
This work proposes a novel practical and general-purpose lossless compression algorithm named Neural Markovian Predictive Compression (NMPC), based on a novel combination of Bayesi...
DCC
2010
IEEE
13 years 3 months ago
2010
IEEE
This paper introduces a new method called Bidirectional Delta file, which is to construct a two way delta file out of two given files. Previous work focuses on forwards and back...
DCC
2010
IEEE
13 years 4 months ago
2010
IEEE
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...
DCC
2010
IEEE
13 years 4 months ago
2010
IEEE
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...
DCC
2010
IEEE
13 years 4 months ago
2010
IEEE
Abstract Cryptanalytic time memory tradeoff algorithms are generic one-way function inversion techniques that utilize pre-computation. Even though the online time complexity is kno...
DCC
2010
IEEE
13 years 4 months ago
2010
IEEE
The two parts of this paper consider combinatorial and geometric aspects of semibent functions. In the first part of this note we obtain 2
DCC
2010
IEEE
13 years 4 months ago
2010
IEEE
In this paper we characterize the d-dimensional dual hyperovals in PG(2d + 1, 2) that can be obtained by Yoshiara's construction [21] from quadratic APN functions and state a...
DCC
2010
IEEE
13 years 4 months ago
2010
IEEE
In the study of multiple-access in the collision channel, conflict-avoiding code is used to guarantee that each transmitting user can send at least one packet successfully in the w...