1,041 reputation
712
bio website embeddedrelated.com/blogs-1/…
location Arizona
age
visits member for 3 years, 9 months
seen Apr 9 at 5:16

Mar
28
comment What comes after tetration ? And after ? And after ? etc.
the symbols didn't get displayed properly
Mar
20
comment Reed-Solomon encoding in GF2?
and there's no relation between GF(256) and the Galois fields used in LFSRs? (I can never remember the technical term for those, a ring over a characteristic polynomial of degree N mod GF(2), or something like that)
Mar
20
comment Reed-Solomon encoding in GF2?
oh, I see, so you can't arbitrarily choose the pair (255,239), for GF(256) it has to be (256 +/- 1, m).
Mar
13
asked Reed-Solomon encoding in GF2?
Feb
23
comment Is it possible to build a circle with quadratic Bézier curves?
just curious: what software did you use to draw the diagram?
Feb
11
accepted Calculating characteristic polynomials of matrices in GF(2)
Feb
10
comment Calculating characteristic polynomials of matrices in GF(2)
So you have to calculate the determinant?
Feb
10
revised Calculating characteristic polynomials of matrices in GF(2)
added 354 characters in body
Feb
10
asked Calculating characteristic polynomials of matrices in GF(2)
Jan
8
revised simple example of recursive least squares (RLS)
added 790 characters in body
Jan
8
comment simple example of recursive least squares (RLS)
That's helpful for some of the conceptual understanding, but how do I figure out the K's? And I still really need to see some numerical data to understand how to choose the gain parameters in practice. Does RLS also give you a global error/noise estimate?
Jan
8
asked simple example of recursive least squares (RLS)
Dec
14
awarded  Good Answer
Oct
8
accepted comparing bit lengths of binary numbers
Oct
7
comment comparing bit lengths of binary numbers
thanks! It looks correct, I'll accept as soon as I have a chance to read more carefully. (Proofs have always eluded me. :/ )
Oct
7
revised comparing bit lengths of binary numbers
fixed logic (should be <=, not =)
Oct
7
comment comparing bit lengths of binary numbers
I didn't say I would get random results, but I couldn't find a counterexample.
Oct
7
asked comparing bit lengths of binary numbers
Oct
3
comment Understanding Primitive Polynomials in GF(2)?
thanks for the reference! I like Saxena & McCluskey's algorithm for finding primitive polynomials.
Oct
3
comment Extended Euclidean Algorithm in bit representation problem
Thanks for mentioning Blankinship's algorithm! I'd never heard of it, but was able to implement it in Python for GF2 very easily.