Please use this identifier to cite or link to this item:
|Title:||Elementary 2-group character codes||Authors:||Kohel, David R.
|Keywords:||DRNTU::Engineering::Computer science and engineering::Data::Coding and information theory||Issue Date:||2000||Source:||Ding, C., Kohel, D. R., & Ling, S. (2000). Elementary 2-group character codes. IEEE Transactions on Information Theory, 46(1), 280-284.||Series/Report no.:||IEEE transactions on information theory||Abstract:||In this correspondance we describe a class of codes over GF(q), where q is a power of an odd prime. These codes are analogs of the binary Reed-Muller codes and share several features in common with them. We determine the minimum weight and properties of these codes. For a subclass of codes we find the weight distribution and prove that the minimum nonzero weight codewords give 1-designs.||URI:||https://hdl.handle.net/10356/96092
|ISSN:||0018-9448||DOI:||http://dx.doi.org/10.1109/18.817529||Rights:||© 2000 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: [DOI: http://dx.doi.org/10.1109/18.817529].||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||SPMS Journal Articles|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.