Equivalent irreducible Goppa codes (Corresp.)
From MaRDI portal
Publication:4182427
DOI10.1109/TIT.1978.1055951zbMath0398.94026OpenAlexW2053476854MaRDI QIDQ4182427
Publication date: 1978
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1978.1055951
Cyclic CodesExtended Goppa CodesGilbert BoundIrreducible Goppa CodesShortened Cyclic CodesUpper Bounds for Number Of Inequivalent Irreducible Goppa Codes
Related Items (9)
Counting irreducible Goppa codes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Two classes of quasi-cyclic codes via irreducible polynomials ⋮ Counting irreducible polynomials of degree \(r\) over \(\mathbb F_{q^n}\) and generating Goppa codes using the lattice of subfields of \(\mathbb F_{q^{nr}}\) ⋮ New bounds on the distance distribution of extended Goppa codes ⋮ Enumeration of inequivalent irreducible Goppa codes ⋮ Counting extended irreducible Goppa codes ⋮ Counting extended irreducible Goppa codes
This page was built for publication: Equivalent irreducible Goppa codes (Corresp.)