In this paper, an analytic expression of minimum solutions for a box-constraint linear symmetric cone program is proposed. The resulting theories are established based on the theory of the spectral decomposition of the symmetric cone. Moreover, we apply our results to develop algorithms for solving several symmetric cone programs and conduct some preliminary numerical experiments to show the performance of the developed algorithms.