arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0911.1298cs.ITmath.AGmath.IT
收藏

仿射格拉斯曼码

Affine Grassmann Codes

Peter Beelen, Sudhir R. Ghorpade, Tom Hoeholdt

摘要:

我们考虑一类新的线性码,称为仿射格拉斯曼码。这些可以被看作是广义Reed-Muller码的变体,并且与Grassmann码密切相关。我们确定的长度,尺寸,和最小距离的任何仿射格拉斯曼码。此外,我们证明了仿射格拉斯曼码有一个大的自同构群,并确定了最小重量码字的数量。

英文摘要:

We consider a new class of linear codes, called affine Grassmann codes. These can be viewed as a variant of generalized Reed-Muller codes and are closely related to Grassmann codes. We determine the length, dimension, and the minimum distance of any affine Grassmann code. Moreover, we show that affine Grassmann codes have a large automorphism group and determine the number of minimum weight codewords.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑