998 reputation
518
bio website
location
age
visits member for 3 years, 10 months
seen yesterday

Nov
25
answered Is it possible to build a circle with quadratic Bézier curves?
Oct
23
awarded  Scholar
Oct
23
accepted How do I find a Bezier curve that goes through a series of points?
Oct
20
awarded  Popular Question
Sep
3
awarded  Yearling
Aug
13
comment Which is better, odd/even Hamming codes or extended Hamming code?
@JyrkiLahtonen: I'm looking at one protocol with about 32 data bits per packet, and another protocol with about 4096 data bits per packet.
Aug
13
comment Which is better, odd/even Hamming codes or extended Hamming code?
@JyrkiLahtonen: (a) I suspect that every kind of Flash memory has the same vulnerability as DRAM -- cosmic rays, draining stored charge in a small region of the chip. Hopefully I can arrange things so that any single stored codeword has its bits spread far enough apart that any single cosmic ray, although damaging dozens of physically nearby bits, will only damage one bit per codeword. So I hope that the Hamming codes used in DRAM ECC memory will work just as well for flash memory.
Aug
13
comment Which is better, odd/even Hamming codes or extended Hamming code?
@JyrkiLahtonen: Yes, I see that "the extended Hamming code" offers more robust protection than "the odd ECC word" alone. However, it is not obvious to me whether "the extended Hamming code" is more or less robust than "the odd+even Hamming code" ("the odd ECC word" and "the even ECC word"). If you could say a few words about why the extended Hamming code is more (or less) robust than "the odd+even Hamming code", I would be happy to accept that as an answer.
Aug
13
revised Which is better, odd/even Hamming codes or extended Hamming code?
clarify (I hope) that by "the even+odd Hamming code" I mean something that uses *both*.
Aug
12
asked Which is better, odd/even Hamming codes or extended Hamming code?
Aug
11
answered Binary code for expected 1-bit errors
Aug
11
awarded  Informed
Jun
1
awarded  Nice Answer
Apr
26
comment Probability of the sum of n numbers giving the same last d digits
Practical application: When the transmitter adds d check digits or b bits of checksum to a message, what is the probability that the receiver will (incorrectly) fail to detect any errors in a random message?
Mar
30
revised Conventional ordering of faces of regular polyhedron?
mention another stackexchange site that may give better answers to a sub-problem.
Mar
25
answered Conventional ordering of faces of regular polyhedron?
Mar
2
answered Finding a quadratic Bézier curve of length $l$ between two points
Mar
2
comment Find points along a Bézier curve that are equal distance from one another
@Kenpachi: The Babylonian method gives you a bunch of "t" values. The x,y coordinates on the curve at any t is given by plugging that t value into the Bezier function B(t). For example, if we want the x coordinate at t=0.1 of a typical cubic Bezier curve with control points P0, P1, P2, P3, we calculate B_x(0.1) = (1-0.1)^3*P0_x + 3*(1-0.1)^2*(0.1)*P1_x + 3*(1-0.1)*(0.1)^2*P2_x + (0.1)^3*P3_x.
Feb
28
answered Find points along a Bézier curve that are equal distance from one another
Feb
16
answered Changing a bezier curve by dragging a point on the curve itself rather than a control point