Classification of a class of A3MDS code and applications in secret-sharing schemes.

A q -ary linear [ n , k , n − k − (i − 1) ] code ℒ is known as A i MDS code. If d = n − k + 1 , the code is called a maximum distance separable code. MDS codes are known to be useful in the secret-sharing schemes and coding theory. In this paper, we classify all binary self-orthogonal A 3 MDS codes. We have introduced a subclass of A 3 MDS codes, called N 3 STMDS codes, to form a special type of secret-sharing scheme where for any participant, there exist (k − 1) other participants who can collectively reveal the secret by combining their shares and there exists another set of (k + 2) participants including the given participant, who cannot reveal the secret. [ABSTRACT FROM AUTHOR]