부산대학교 도서관

The weight enumerator of a block code (initially over a finite field) is always a hot topic in coding theory. Recently, the focus shifted to the weight enumerator of a block code over a finite ring. In this direction, the present paper studies the Lee-weight distributions of several classes of linear codes over the finite chain ring $\Bbb F_p + u\Bbb F_p$. The paper determines the complete weight enumerator of their Gray images under the Gray map. In addition, it proves that there can be infinite families of minimal five-weight linear codes with $ \frac{w_{\min}}{w_{\max}} < \frac{p-1}{p}$, where $w_{\min}$ and $w_{\max}$ denote the minimum and maximum nonzero Hamming weights in the code. Results and examples in the paper are quite elaborative.