150 reputation
9
bio website
location
age
visits member for 2 years, 6 months
seen Jul 9 at 17:39

Apr
8
comment Generalization of a projective plane?
I can't create a tag, but I was wondering if it would make sense to have a "finite-geometry" tag.
Apr
8
asked Generalization of a projective plane?
Apr
4
asked Intersection of blocks of the symmetric BIBD $PG(d,q)$
Oct
26
accepted Ordering compositions of integers, where cyclic shifts are not considered distinct
Oct
26
revised Ordering compositions of integers, where cyclic shifts are not considered distinct
added 3 characters in body
Oct
26
comment Ordering compositions of integers, where cyclic shifts are not considered distinct
Please help me with the tags; I have < 300 reputation so I cannot create tags related to "integer compositions" "ordering", etc. Not sure what else to tag there.. Thank you.
Oct
26
asked Ordering compositions of integers, where cyclic shifts are not considered distinct
Jul
8
comment References for this kind of combinatorial objects? (lists of integers with small number of distinct pairwise differences)
@AndréNicolas Didn't know about that problem.. That's very interesting.
Jul
8
comment References for this kind of combinatorial objects? (lists of integers with small number of distinct pairwise differences)
Thank you for the providing a on-the-spot theory, that helps a lot.
Jul
8
accepted References for this kind of combinatorial objects? (lists of integers with small number of distinct pairwise differences)
Jul
5
asked References for this kind of combinatorial objects? (lists of integers with small number of distinct pairwise differences)
Feb
22
comment Are linear shift register sequences corresponding to reciprocal polynomials equivalent?
Thank you sir for helping me one more time with my understanding of LFSRs!
Feb
22
accepted Are linear shift register sequences corresponding to reciprocal polynomials equivalent?
Feb
6
comment Are linear shift register sequences corresponding to reciprocal polynomials equivalent?
Thanks for the feedback! The definition according to the paper that I am reading ("Shift-Register Synthesis and BCH Decoding", by J.L. Masssey) is that the leading coefficient corresponds to the output bit. Now, regarding the reciprocal thing: Do you have any reference or hints about the proof? And furthermore, are you sure that this holds for non-maximal sequences (i.e. when the corresponding polynomial is non-primitive)?
Feb
5
revised Are linear shift register sequences corresponding to reciprocal polynomials equivalent?
I think "sequences" is also a relevant tag..
Feb
5
comment Are linear shift register sequences corresponding to reciprocal polynomials equivalent?
Ah, no. I am studying LFSRs for their own sake, possibly later I'll see some applications in cryptography. In particular I was studying the Berlekamp-Massey algorithm which returns the connection polynomial of a given a sequence if enough elements of the sequence are given. The implementation in sage seems to return the reciprocal and I'm trying to figure out what gives.. That said, I find it kind of an interesting question on its own..
Feb
5
asked Are linear shift register sequences corresponding to reciprocal polynomials equivalent?
Dec
12
awarded  Commentator
Dec
12
comment Can every periodic binary sequence be expressed as the output of a Linear or Non-Linear Feedback Shift Register?
Thanks, I have heard about those sequences but didn't know what they were.
Dec
12
comment Can every periodic binary sequence be expressed as the output of a Linear or Non-Linear Feedback Shift Register?
Indeed, my background was from the top of my head and wrong at times, I have corrected the parts of the question that were wrong, thanks. Indeed, I have been looking around and when it comes to the non-linear case things are messy. Finding NLFSR's with guaranteed long periods is apparently a notoriously hard problem and every now and then somebody may publish a paper examinning a specific family of such sequences, but this is definitely not a question that would get a straightforward answer. As you said, for the linear case, the minimal LFSR is given by the Berlekamp-Massey algorithm.