Please use this identifier to cite or link to this item:
https://doi.org/10.1109/18.817529
DC Field | Value | |
---|---|---|
dc.title | Elementary 2-group character codes | |
dc.contributor.author | Ding, C. | |
dc.contributor.author | Kohel, D. | |
dc.contributor.author | Ling, S. | |
dc.date.accessioned | 2013-07-23T09:22:46Z | |
dc.date.available | 2013-07-23T09:22:46Z | |
dc.date.issued | 2000 | |
dc.identifier.citation | Ding, C., Kohel, D., Ling, S. (2000). Elementary 2-group character codes. IEEE Transactions on Information Theory 46 (1) : 280-284. ScholarBank@NUS Repository. https://doi.org/10.1109/18.817529 | |
dc.identifier.issn | 00189448 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/43018 | |
dc.description.abstract | In this correspondence 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. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/18.817529 | |
dc.source | Scopus | |
dc.type | Article | |
dc.contributor.department | COMPUTER SCIENCE | |
dc.contributor.department | MATHEMATICS | |
dc.description.doi | 10.1109/18.817529 | |
dc.description.sourcetitle | IEEE Transactions on Information Theory | |
dc.description.volume | 46 | |
dc.description.issue | 1 | |
dc.description.page | 280-284 | |
dc.description.coden | IETTA | |
dc.identifier.isiut | 000084870900027 | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.