Three-weight minimal linear codes (Q2147618)

The author explains the necessary and sufficient condition for a linear code over \(R\) to be minimal. Also, it is proved that if \(C\) is minimal then \(\phi(C)\) is minimal. The infinite family of Lee weight linear codes is constructed and the family of minimal ternary three Hamming weight linear codes over the finite field \(\mathbb{F}_3\) is determined, this result which helps to violate the Ashikhmin-Barg condition. In this connection, the author provides all the references clearly.