Abstract
Recently, several authors used linear codes to construct secret sharing schemes. It is known that if each nonzero codeword of a code [Formula: see text] is minimal, then the dual code [Formula: see text] is suitable for secret sharing. To seek such codes Ashikhmin–Barg give a sufficient condition from weights; in [Formula: see text] code [Formula: see text], let [Formula: see text] and [Formula: see text] be the minimum and maximum nonzero weights, respectively. If [Formula: see text] then all nonzero codewords of [Formula: see text] are minimal. In this paper, a necessary and sufficient condition is given for self-dual codes and for MDS codes to verify the inequality (*). Special codes are examined and applied for secret sharing schemes.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
