Generator polynomials of cyclic expurgated or extended Goppa codes
CoRR(2024)
摘要
Classical Goppa codes are a well-known class of codes with applications in
code-based cryptography, which are a special case of alternant codes. Many
papers are devoted to the search for Goppa codes with a cyclic extension or
with a cyclic parity-check subcode. Let F_q be a finite field with
q=2^l elements, where l is a positive integer. In this paper, we determine
all the generator polynomials of cyclic expurgated or extended Goppa codes
under some prescribed permutations induced by the projective general linear
automorphism A ∈ PGL_2( F_q). Moreover, we provide some examples to
support our findings.
更多查看译文
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要