Abstract
A [Formula: see text]-ary linear [Formula: see text] code [Formula: see text] is known as [Formula: see text] code. If [Formula: see text] the code is called a maximum distance separable code. [Formula: see text] codes are known to be useful in the secret-sharing schemes and coding theory. In this paper, we classify all binary self-orthogonal [Formula: see text] codes. We have introduced a subclass of [Formula: see text] codes, called [Formula: see text] codes, to form a special type of secret-sharing scheme where for any participant, there exist [Formula: see text] other participants who can collectively reveal the secret by combining their shares and there exists another set of [Formula: see text] participants including the given participant, who cannot reveal the secret.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
