Elementary 2-group character codes
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 t...
Saved in:
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/96092 http://hdl.handle.net/10220/9819 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-96092 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-960922023-02-28T19:32:42Z Elementary 2-group character codes Kohel, David R. Ding, Cunsheng Ling, San School of Physical and Mathematical Sciences DRNTU::Engineering::Computer science and engineering::Data::Coding and information theory 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. Accepted version 2013-04-16T08:57:38Z 2019-12-06T19:25:31Z 2013-04-16T08:57:38Z 2019-12-06T19:25:31Z 2000 2000 Journal Article Ding, C., Kohel, D. R., & Ling, S. (2000). Elementary 2-group character codes. IEEE Transactions on Information Theory, 46(1), 280-284. 0018-9448 https://hdl.handle.net/10356/96092 http://hdl.handle.net/10220/9819 10.1109/18.817529 en IEEE transactions on information theory © 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]. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
DRNTU::Engineering::Computer science and engineering::Data::Coding and information theory |
spellingShingle |
DRNTU::Engineering::Computer science and engineering::Data::Coding and information theory Kohel, David R. Ding, Cunsheng Ling, San Elementary 2-group character codes |
description |
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. |
author2 |
School of Physical and Mathematical Sciences |
author_facet |
School of Physical and Mathematical Sciences Kohel, David R. Ding, Cunsheng Ling, San |
format |
Article |
author |
Kohel, David R. Ding, Cunsheng Ling, San |
author_sort |
Kohel, David R. |
title |
Elementary 2-group character codes |
title_short |
Elementary 2-group character codes |
title_full |
Elementary 2-group character codes |
title_fullStr |
Elementary 2-group character codes |
title_full_unstemmed |
Elementary 2-group character codes |
title_sort |
elementary 2-group character codes |
publishDate |
2013 |
url |
https://hdl.handle.net/10356/96092 http://hdl.handle.net/10220/9819 |
_version_ |
1759855061209448448 |