The best algorithms to decode a random code (this problem is called "generic decoding") rely on information set decoding (ISD). The seminal idea is due to Prange (1962) and was imporved independantly by Stern (1988) and Dumer (1991). Since then, new state of the art were proposed to lower the asymptotic exponent. A (non-exhaustive) list of the main papers concerning these algorithms is available in the documentation section of the decoding challenge website. Unfortunately there exists no survey on the state of the art generic decoding algotithms but here is a list of documents that can be useful to understand them.