Reed-Solomon codes are now widely used in digital communication, which are an important class of maximum distance separable codes. we usually use the maximum likelihood decoding algorithm in the decoding process of Reed-Solomon codes. For the received word $u\in\mathbb{F}_q$, maximum likelihood decoding algorithm lies in determining its error distance $d(u,C)$. We have known that $d (u, C)\leq n-k$, where $n,k$ are the length and dimension of code $C$. If $d (u, C) =n-k$, then $u$ is called a deep hole of $C$. In 2012, Hong and Wu had proposed a famous deep hole conjecture of standard Reed-Solomon code. In this paper, we proved Wu-Hong conjecture of standard Reed-Solomon codes by using the generator matrix of maximum distance separable code.
