Abelian码的构造:倍增循环码的维数
Constructions of Abelian Codes multiplying dimension of cyclic codes
AI总结:
本文提出一种从循环码构造二元Abelian码的方法,倍增维数并保持表观距离,且对最大BCH界等于最小距离的循环码,所得Abelian码的强表观距离与最小距离一致,并应用于Reed-Solomon码。
摘要:
在本文中,我们应用文献[1]-[3]中发展的技术,给出一种从循环码构造二元Abelian码的特殊方法,该方法倍增了循环码的维数并保持了其表观距离。我们证明,对于最大BCH界等于其最小距离的循环码,所得到的Abelian码也满足相同性质;即,强表观距离与最小距离相等。最后,我们利用此构造将Reed-Solomon码倍增为Abelian码。
英文摘要:
In this note, we apply some techniques developed in [1]-[3] to give a particular construction of bivariate Abelian Codes from cyclic codes, multiplying their dimension and preserving their apparent distance. We show that, in the case of cyclic codes whose maximum BCH bound equals its minimum distance the obtained abelian code verifies the same property; that is, the strong apparent distance and the minimum distance coincide. We finally use this construction to multiply Reed-Solomon codes to abelian codes
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。