Example of a code that can be decoded using bounded distance decoder

Question

In the book Information theory, Inference and Learning Algorithm, in chapter 13, MacKay defines bounded distance decoding

A bounded distance decoder is a decoder that returns the closest codeword to a received binary vector $\mathbf{r}$ if the distance from $\mathbf{r}$ to that codeword is less than or equal to $t$; otherwise it returns a failure message.

Could anybody provide an example of a simple linear code that can be decoded by such a bounded distance decoder?