Reed-Solomon codes are linear, cyclic codes that can be used to ensure that a correct message is received provided that there are at most a specific number of errors. One of the methods to deal with the decoding of received messages is the Guruswami-Sudan list decoding algorithm. This paper will present several of the properties of list decoding, including a detailed analysis of list decoding with lists of size one and the optimal benefits of list decoding.