I'm storing many files of various lengths into a block-oriented medium (fixed-size e.g. 1024 bytes). When reading back the file, each block will either be missing or correct (no bit errors or the like). The missing blocks are random, and there's not necessarily any sequence to the missing blocks. I'd like to be able to reassemble the ...
I have recently been web-researching quantum computing. Will we see these in our lifetimes (ever?) (The error correction issue, for example, seems intractable to me). ...
I'm interested in using a Reed-Solomon error correction [http://en.wikipedia.org/wiki/Reed%E2%80%93Solomon_error_correction as a reference] to try to rebuild files from partial bits of a file. I'm doing this as a personal interest. I recently read about WuaLa [http://www.wua.la/] and I'm interested in how they leverage Reed-Solomon to r...
Systems could use UDP and employ forward error correction to transmit the whole message, without retransmits, even if a few packets are lost. Does this ever work well in practice or is the extra overhead too much of a waste? ...
I have a binary stream that has a very high error rate. The error rate is 50% meaning each bit has a 50% chance of being flipped. The error does not occur in bursts and is completely random, so Reed–Solomon codes wouldn't work well. Which scheme or algorithm should I apply to the stream? I don't care about the overhead at all. This ...
So I want to work on this summer project to correct errors in a message transmission using Hamming Code, but I cannot figure out how it really works. I've read many articles online, but I don't really understand the algorithm. Can anybody explain it in simple terms? Thanks. ...
Is there a CRC library that enables the user not only detect errors but also correct them? I'm looking for a C/C++ or Java library, ideally open-source. ...
I've got a sequence of 28 bytes, which are supposedly encoded with a Reed-Solomon (28, 24, 5) code. The RS code uses 8-bit symbols and operates in GF(28). The field generator polynomial is x8+x4+x3+x2+1. I'm looking for a simple way to decode this sequence, so I can tell if this sequence has errors. I've tried the Python ReedSolomon mod...
If I want to send a d-bit packet and add another r bits for error correction code (d>r) how many errors I can find and correct at most? ...
Over the past couple of weeks I've read through the book Error Control Coding: Fundamentals and Applications in order to learn about BCH (Bose, Chaudhuri, Hocquenghem) Codes for an junior programming role at a telecoms company. This book mostly covers the mathematics and theory behind the subject, but I'm struggling to implement some of...
I have some designing to do for a serial protocol and am running into some questions that I figure must have been considered elsewhere. So I'm wondering if there are some recommendations for best practices in designing serial protocols. (Please either state a fact that is easily verifiable, or cite a reputable source if you make a claim...
I'm looking for a forward error-correcting code that is relatively easy/fast to encode on a microcontroller; decode will be done on a PC so it can be more complicated. I don't know that much about error-correcting codes and except for the simple Hamming codes they seem to all be more complicated than I can handle. Any recommendations? ...
I'm in a Math class about coding theory and we have to do a project for our term mark. My project is a client with an echo server, which shows what errors were introduced in the trip from the client to the server, and then back. And test different error correcting schemes for efficiency and how well they are suited to this task. The ...
Does Reed-Solomon error correction work in an instance where there is a dropped byte (or multiple dropped bytes)? For example, let's say it's a (12,8) Reed Solomon code, so theoretically it should be able to correct 2 errors (or 4 erasures if the position is known). But, what happens if only 11 (or 10) bytes are received and one doesn'...
I have an application that ideally would allow 25% of errors to be corrected with an original message that would be 12 to 16 bytes (8-bit bytes) long. The constraints are the message cannot be retransmitted and if parts of message aren't received it will be unknown which bytes did not show up. For example, let's say, I'm using somethin...
Is it mathematically feasible to encode and initial 4 byte message into 8 bytes and if one of the 8 bytes is completely dropped and another is wrong to reconstruct the initial 4 byte message? There would be no way to retransmit nor would the location of the dropped byte be known. If one uses Reed Solomon error correction with 4 "parity...
Is there a well-known implementation, that has friendly open-source licensing (not GPL), of an ECC (error correcting code) library (e.g. Reed-Solomon) for Java? ...
I was doing some unit testing at work and a peculiar error popped up for one of the assertions. Note that expectedValue and actualValue are both doubles. Assert.AreEqual(expectedValue, actualValue); The exception stated that they were not equal, elaborating that "expected value: <6.8> actual value: <6.8>." The expected value is a har...
The problem I am trying to improve the result of an OCR process by combining the output from three different OCR systems (tesseract, cuneinform, ocrad). I already do image preprocessing (deskewing, despeckling, threholding and some more). I don't think that this part can be improved much more. Usually the text to recognize is between on...
Hi, I'd like advice on a book or web resource, that comprehensively teaches me Reed-Solomon error correction. I found some web resources and some university PDF's, but none of them was able to really teach me how to compute it (and error correct afterwards). I'd prefer a book on it if possible. For clarification: I'm not looking for a...