A family of group character codes
In IEEE Trans. Inform. Theory 46 (2000), 280, using characters of an elementary Abelian 2-group, a class of q-ary codes, where q is an odd prime power, is constructed. These codes share several features in common with binary Reed–Muller codes. This construction is generalized in this paper to yield...
Main Author: | Ling, San |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Journal Article |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/79659 http://hdl.handle.net/10220/9835 |
Similar Items
-
Elementary 2-group character codes
by: Kohel, David R., et al.
Published: (2013) -
Split group codes
by: Kohel, David R., et al.
Published: (2013) -
Asymptotic bounds on quantum codes from algebraic geometry codes
by: Feng, Keqin, et al.
Published: (2013) -
Secret-sharing with a class of ternary codes
by: Kohel, David R., et al.
Published: (2013) -
Redundantly grouped cross-object coding for repairable storage
by: Datta, Anwitaman, et al.
Published: (2012)