Sciweavers

539 search results - page 3 / 108
» Linear complexity of transformed sequences
Sort
View
TIT
2008
78views more  TIT 2008»
13 years 7 months ago
New Binary Sequences With Optimal Autocorrelation Magnitude
New binary sequences of period
Nam Yul Yu, Guang Gong
EUROCAST
2005
Springer
166views Hardware» more  EUROCAST 2005»
14 years 28 days ago
A New Pseudo-Random Generator Based on Gollmann Cascades of Baker-Register-Machines
In this paper, we present a new pseudo-random sequence generator, constructed by the generalized discrete Baker transformation. This new generator is called Cascaded Baker Register...
Dominik Jochinger, Franz Pichler
ACISICIS
2005
IEEE
13 years 9 months ago
Equivalence of Transforming Non-Linear DACG to Linear Concept Tree
This paper introduces a strategy and its theory proof to transform non-linear concept graph: Directed Acyclic Concept Graph (DACG) into a linear concept tree. The transformation i...
Wenyi Bi, Junping Sun
BMCBI
2007
147views more  BMCBI 2007»
13 years 7 months ago
Comparative analysis of long DNA sequences by per element information content using different contexts
Background: Features of a DNA sequence can be found by compressing the sequence under a suitable model; good compression implies low information content. Good DNA compression mode...
Trevor I. Dix, David R. Powell, Lloyd Allison, Jul...
TCC
2007
Springer
170views Cryptology» more  TCC 2007»
14 years 1 months ago
Secure Linear Algebra Using Linearly Recurrent Sequences
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew...