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


Enumeration of inequivalent irreducible Goppa codes
Authors:John A Ryan
Institution:a Department of Mathematics, Mzuzu University, P/Bag 201, Luwinga, Mzuzu 2, Malawi
b Boole Centre for Research in Informatics, University College Cork, Cork, Ireland
Abstract:We consider irreducible Goppa codes over Fq of length qn defined by polynomials of degree r, where q is a prime power and n,r are arbitrary positive integers. We obtain an upper bound on the number of such codes.
Keywords:Classical Goppa codes  Enumeration  Cauchy-Frobenius theorem
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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