Reed–Solomon错误更正
数学
代数曲线
属
离散数学
里德-穆勒码
编码理论
组合数学
类型(生物学)
线性码
区块代码
算法
解码方法
生态学
生物
植物
标识
DOI:10.1109/tit.2023.3348146
摘要
It is always interesting and important to construct non-Reed-Solomon type MDS codes in coding theory and finite geometries. In this paper, we prove that many non-Reed-Solomon type MDS codes from arbitrary genus algebraic curves can be constructed. It is proved that MDS algebraic geometry (AG) codes from higher genus curves are not equivalent to MDS AG codes from lower genus curves. For genus one case, we construct MDS AG codes of small consecutive lengths from elliptic curves. New self-dual MDS AG codes over F 2s from elliptic curves are also constructed. These MDS AG codes are not equivalent to Reed-Solomon codes, not equivalent to known MDS twisted Reed-Solomon codes and not equivalent to Roth-Lempel MDS codes. Hence many non-Reed-Solomon type MDS AG codes, which are not equivalent to known MDS twisted-Reed-Solomon codes and Roth-Lempel MDS codes, can be obtained from arbitrary genus algebraic curves. It is interesting open problem to construct explicit longer MDS AG codes from maximal curves.
科研通智能强力驱动
Strongly Powered by AbleSci AI