首页 | 本学科首页   官方微博 | 高级检索  
     


Generalizing binary quadratic residue codes to higher power residues over larger fields
Authors:P. Charters
Affiliation:Department of Mathematics, University of Texas at Austin, 1 University Station, C1200, Austin, TX 78712, United States
Abstract:
In this paper, we provide a generalization of binary quadratic residue codes to the cases of higher power prime residues over the finite field of the same order. We find generating polynomials for such codes, define a new notion corresponding to the binary concept of an idempotent, and use this to find a lower bound for the codeword weight of the duals of such codes. This in turn leads to a lower bound on the weight of the codewords themselves.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号