Based on the fact that the projection of the Leech lattice on GF(4) is the (6
3
4)Hexacode
a new bounded distance decoding algorithm is presented. its complexity is at most 1151
at least 575
and 911 real operations on the average
as compared to the fastest BD algorithm shown in[10)
whose complexity is at most 1007
at least 911 and 959 on the average. The computer simulation shows that the loss in coding gain of our algorithm relative to maximum likelihood decoding algorithm is only about 0. 02dB