TIT
2010
13 years 5 months ago
2010
Arguably, the most prominent constrained system in storage applications is the (d; k)-run-length limited (RLL) system, where every binary sequence obeys the constraint that every t...
DMTCS
2007
13 years 10 months ago
2007
A binary sequence of zeros and ones is called a (d, k)-sequence if it does not contain runs of zeros of length either less than d or greater than k, where d and k are arbitrary, b...
DM
2008
13 years 11 months ago
2008
Let EN = (e1, e2, . . . , eN ) be a binary sequence with ei {+1, -1}. For 2 k N, the correlation measure of order k of the sequence is defined by Mauduit and S
IPPS
1999
IEEE
14 years 3 months ago
1999
IEEE
Abstract. Themain contributionof thiswork isto propose a numberof broadcastefficient VLSI architectures for computing the sum and the prefix sums of a w k-bit, k 2, binary sequenc...
AAECC
2006
Springer
14 years 4 months ago
2006
Springer
Abstract. We consider the problem of determining the period of a binary sequence. For sequences with small autocorrelation we prove the existence of a polynomial time quantum algor...
AAECC
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We review a binary sequence based on the generalized cyclotomy of order 2 with respect to p3 , where p is an odd prime. Linear complexities, minimal polynomials and autoc...