| Abstract: |
| Let C be a linear code. A codeword c of C is said to be a minimal codeword if its support (i.e. the set of non-zero coordinates) does not contain the support of any other independent codeword. A linear code is said minimal if all its nonzero codewords are minimal.
It is known that minimal codewords can be used in linear codes-based access structures in secret sharing schemes (SSS), which are protocols with a distribution algorithm and a reconstruction algorithm, implemented by a dealer and some participants.
Recently, many constructions of minimal codes appeared in the literature. Here we present some new constructions of minimal codes in odd characteristic. |
|