Skip to main content
2 votes
Accepted

Minimum Output Samples needed to crack a "Gold Code" Generator (Dual LFSR)

! The answer by @cbos is correct in spirit but wrong in its details. In an answer on crypto.SE, I wrote "The Berlekamp-Massey algorithm is an iterative algorithm that solves the following ...
Dilip Sarwate's user avatar
2 votes

Minimum Output Samples needed to crack a "Gold Code" Generator (Dual LFSR)

cbos's user avatar
  • 71
2 votes

Calculating Hamming distance effectively: a fast approach

In 4-bit packed binary-coded decimal (BCD) each of your strings will take 4*32 = 128 bits, which just fits in two 64-bit registers. With some binary wizardry you can calculate the Hamming distance in ...
Olli Niemitalo's user avatar
1 vote
Accepted

call decimate function from matlab

Matlab uses double values by default. Scipy.signal.decimate expects an integer as the second argument, the decimation factor. ...
Jdip's user avatar
  • 6,814
1 vote
Accepted

About the orthogonality of columns in Zadoff-Chu matrix

For complex matrices, the concept of orthogonality is replaced by unitarity. If $^H$ denotes the conjugate transpose of a matrix, we should check that $W$ is a unitary matrix (up to a scaling factor) ...
Laurent Duval's user avatar
1 vote
Accepted

Definition of Perfect Code (and example of Hamming Code)

I give an explanation that avoids the pejorative comments of Engineer. First question: can you explain me these two definitions of perfect code? Those are not two definitions of perfect codes but ...
Dilip Sarwate's user avatar
1 vote
Accepted

About Data spreading in CDMA

There's no lower and upper general limits, aside from the fact that you need to transmit at least 1 bit, and that your spreading sequence should be longer than 1. By the way, you typically apply ...
Marcus Müller's user avatar
1 vote

Calculating Hamming distance effectively: a fast approach

Your problem might be easier if you trade memory for speed. First of all, you only got ten values, so the whole "hamming distance of sub-element" can be sped up by either a elegant SIMD, or really by ...
Marcus Müller's user avatar
1 vote

Calculating Hamming distance effectively: a fast approach

First, note that any form of compression, clustering etc. will require its own computational power. So only if it can significantly reduce the complexity such that the overall task has a reduced ...
msm's user avatar
  • 4,315

Only top scored, non community-wiki answers of a minimum length are eligible