Introduction - If you have any usage issues, please Google them yourself
LTcodesareasymptoticallyoptimalratelesserasurecodeswithhighlyefficientencod-inganddecodingalgorithms.Intheoriginalanalysisofthesecodes, itwasassumedthat foreachencodingsymbol, theneighborsusedtogeneratethatencodingsymbolarechosen uniformlyatrandom. PracticalimplementationsofLTcodescannotaffordthisamountofrandomness, be-causeallrandombitsmustbecommunicatedtothedecodingparty.Instead, theyuse alinearcongruentialgeneratortoreducetherandomnessusedperencodingsymboltoa seedconsistingoftworandomnumbers.Weshowthatsuch limitedrandomness LTcodes performalmostaswellasthefullyrandomversion.ThusevenlimitedrandomnessLT codesareasymptoticallyoptimal.