dolphinling's weblog » math http://blog.dolphinling.net ...whatever goes through my head... Thu, 20 Aug 2009 21:48:47 +0000 en hourly 1 http://wordpress.org/?v=3.0.1 vdash http://blog.dolphinling.net/2008/10/vdash/ http://blog.dolphinling.net/2008/10/vdash/#comments Sat, 11 Oct 2008 03:41:34 +0000 dolphinling http://blog.dolphinling.net/?p=206 http://vdash.org/ looks very interesting. It also looks like the kind of thing that could help me practice with really formalizing my proofs (though I think currently I usually know how, I’m just too lazy).

]]> http://blog.dolphinling.net/2008/10/vdash/feed/ 0 Wikipedia is supposed to make it EASIER to slack off, right? http://blog.dolphinling.net/2008/04/wikipedia-is-supposed-to-make-it-easier-to-slack-off-right/ http://blog.dolphinling.net/2008/04/wikipedia-is-supposed-to-make-it-easier-to-slack-off-right/#comments Mon, 14 Apr 2008 00:46:59 +0000 dolphinling http://blog.dolphinling.net/2008/04/wikipedia-is-supposed-to-make-it-easier-to-slack-off-right/ So I have a paper to research on coding theory (error correcting codes and the like) and I’ve been reading wikipedia pages for a few hours. I go to get a mint and decide it’s time to take a short break while I play around with the circular mints, trying to pack as many into one layer of the container as possible. As I read the wikipedia page on sphere packing, I come across

Sphere packing on the corners of a hypercube (with the spheres defined by Hamming distance) corresponds to designing error-correcting codes: if the spheres have radius d, then their centers are codewords of a d-error-correcting code. Lattice packings correspond to linear codes. There are other, subtler relationships between Euclidean sphere packing and error-correcting codes; thus, the binary Golay code is closely related to the 24-dimensional Leech lattice.

Grr. Stupid wikipedia, I was trying to slack off. >:o

]]> http://blog.dolphinling.net/2008/04/wikipedia-is-supposed-to-make-it-easier-to-slack-off-right/feed/ 0