News for hackers. Stuff that matters.
Re:Researchers Defeat Randomness to Create Ideal Code by mirekrusin on Saturday November 27, 2021 @02:33AM (#29358335)
No you don’t, you need to read at most 2 bits past corrupted one to detect it.
Re:Researchers Defeat Randomness to Create Ideal Code by dataflow on Saturday November 27, 2021 @02:35AM (#29358343)
The question is how do you know which one is corrupted before reading all of them??
Re:Researchers Defeat Randomness to Create Ideal Code by mirekrusin on Saturday November 27, 2021 @03:28AM (#29358579)
You don't need to read 1 million bits to detect 5th being corrupted one, you will know it after reading 3 * 5 = 15 bits.
Re:Researchers Defeat Randomness to Create Ideal Code by dataflow on Saturday November 27, 2021 @03:31AM (#29358601)
Yeah and what if instead of being the 5th bit it was the 1 millionth bit that was corrupted?
Re:Researchers Defeat Randomness to Create Ideal Code by mirekrusin on Saturday November 27, 2021 @05:45AM (#29359172)
For 1 million bits message where millionth bit is corrupted last bit doesn't have to be read, in general in 3 replica coding, reading first 2 is enough if they are the same - reading last one will have no effect.
Re:Researchers Defeat Randomness to Create Ideal Code by dataflow on Saturday November 27, 2021 @05:48AM (#29359189)
For heaven's sake... how in the world would you know it's the millionth bit that's corrupted without scanning all 999,999 other bits at least once?!?!

Do you data streams always come magically tagged with sentences like "Hey, watch out for bits 999,998-1,000,000, but all my other bits are intact so you can skip them!" or something??! You somehow "know" the error is in the final 3 bits and not in the earlier 999,997 bits because... magic??

Re:Researchers Defeat Randomness to Create Ideal Code by mirekrusin on Saturday November 27, 2021 @12:24PM (#29361740)
No, it doesn't work that way.