0
votes
0answers
19 views

Pseudorandom Noise Sequences

A PN sequence based on LFSR can be analyzed using the Berlekamp-Massey algorithm. If I have a sequence that is a combination of two LFSR sequences, is there a similar way to recover the two LFSR ...
4
votes
1answer
158 views

Does this theorem have a name?

Let P(x) be a polynomial of degree n. Let H(i) represent the number of 1's in the binary expansion of the integer i. Although reasonably easy to prove, it may seem surprising that the following ...
2
votes
1answer
287 views

Perfect codes and the Golay codes

I've been working on exercises from various textbooks to get a better understading about perfect codes. There is a theorem that states: Theorem: The only nontrivial perfect multiple ...
2
votes
0answers
69 views

(Please check working) Given RSA encoding function $E: x\to x^{11} \pmod{3737}$ find the decoding function $D$

Please check the working and final answer to the question: Question: Given RSA encoding function $E: x\to x^{11} \pmod{3737}$ find the decoding function $D$ My working: $\phi(3737) = \phi(37) \times ...
2
votes
1answer
2k views

finding the LFSR and connection polynomial for binary sequence

I have written a C implementation of the Berlekamp-Massey algorithm to work on finite fields of size any prime. It works on most input, except for the following binary GF(2) sequence: 0110010101101 ...