So, I learned about Hamming codes a while back. They're pretty neat, but a lot of modern technology uses Reed-Solomon instead. I've wanted to learn about that one, but it involves some pretty heavy math that often goes over my head.
I've found a few different videos on YouTube that try to explain it "simply" but they all tend to gloss certain details over. After watching a few of them, I've noticed that the parts they gloss over are different from each other, and I'm wondering if I can just hunt down enough of them that I can piece the rest together myself.
All things considered, this seems a weirdly fitting way to learn it.
like this
Jonathan Lamothe
in reply to Jonathan Lamothe • •I thought I'd come up with a genius alternate solution the the problem that Reed-Solomon aims to solve, but then I figured out why nobody does it.
The idea was to interleave multiple Hamming code blocks together so that the bits of each individual block would be sufficiently distant from each other as to protect against a burst error. While this would work, I realized pretty quickly that the sorts of media that are susceptible to burst errors also tend to suffer a significant speed penalty when reading data that is scattered across the medium like this.
Back to the grind of trying to figure this out, I guess.
Jonathan Lamothe
in reply to Jonathan Lamothe • •Jonathan Lamothe
in reply to Jonathan Lamothe • •𝚛𝚊𝚝 reshared this.
Jonathan Lamothe
in reply to Jonathan Lamothe • •