I did bother to read it, and that isn't what I meant. I wasn't referring to one-off errors that you can fix after successfully decoding a cipher into something that produces a majority-correct answer. I meant something more akin to what schoen's answer touched on: whether there are any closed-form mathematical/statistical analyses that can be performed ahead of time to assess the structural legitimacy of any ciphertext before you spend a lot of cycles trying to decode it.
Thanks for the driveby snark though!