Counting generalized Reed-Solomon codes

Peter Beelen, David Glynn, Tom Høholdt, Krishna Kaipa

Research output: Contribution to journalJournal articleResearchpeer-review

254 Downloads (Pure)

Abstract

In this article we count the number of [n, k] generalized Reed–Solomon (GRS) codes, including the codes coming from a non-degenerate conic plus nucleus. We compare our results with known formulae for the number of [n, 3] MDS codes with n = 6, 7, 8, 9.
Original languageEnglish
JournalAdvances in Mathematics of Communication
Volume11
Issue number4
Pages (from-to)777--790
ISSN1930-5346
DOIs
Publication statusPublished - 2017

Fingerprint Dive into the research topics of 'Counting generalized Reed-Solomon codes'. Together they form a unique fingerprint.

Cite this