Abstract: Minimal linear codes are widely used in constructing secret sharing schemes with safe and efficient access structures. The extended codes of several classes of linear codes are studied, and their parameters and weight distributions are calculated. It is proved that all the extended codes are minimal ones and thus can be used to construct secret sharing schemes. Besides, some optimal or almost optimal codes are given.

Key words: linear code, extended code, minimal code, secret sharing, weight distribution