Secret sharing schemes play fundamental roles in many cryptographic applications, and hence they have been constructed by using various mathematical tools. As we all know, the most famous Shamir scheme and Asmuth-Bloom scheme are based on polynomials over finite field and Chinese Reminder Theorem (CRT) for integers, respectively. Compared with Shamir scheme, Asmuth-Bloom scheme has a lower information rate, but it has a lower computational complexity in its secret reconstruction phase. In ASIACRYPT 2018, Ning et al. constructed a perfect (r,n)-threshold scheme based on CRT for polynomial ring over finite field, and the corresponding information rate is one which is the greatest information rate for a (r,n)-threshold scheme. However, perfect security is too much security for many practical purposes. In this work, we generalize the scheme of Ning et al. to a (t,r,n)-ramp scheme based on CRT for polynomial ring over finite field, which has the greatest information rate (r-t) for a (t,r,n)-ramp scheme. Moreover, for any give $r_1