On the covering structures of two classes of linear codes from perfect nonlinear functions
Date of Issue2009
School of Physical and Mathematical Sciences
In this paper, the weight distributions of two classes of linear codes based on all known explicit perfect nonlinear functions from Fqm to itself are determined using a unified approach. All the minimal codewords of these codes are characterized according to their weights, which suggests that their covering structures are determined. Finally, all the minimal access sets of the secret sharing schemes based on their dual codes are obtained.
DRNTU::Engineering::Computer science and engineering::Data::Coding and information theory
IEEE transactions on information theory
© 2009 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [http://dx.doi.org/10.1109/TIT.2008.2008145].