Counting generalized Reed-Solomon codes

Autor:	Tom Høholdt, Krishna Kaipa, David G. Glynn, Peter Beelen
Jazyk:	angličtina
Rok vydání:	2016
Předmět:	FOS: Computer and information sciences Discrete mathematics Algebra and Number Theory Discrete Mathematics (cs.DM) Computer Networks and Communications Information Theory (cs.IT) Applied Mathematics Computer Science - Information Theory 020206 networking & telecommunications 0102 computer and information sciences 02 engineering and technology 01 natural sciences Microbiology Linear code Combinatorics 010201 computation theory & mathematics Reed–Solomon error correction Conic section 0202 electrical engineering electronic engineering information engineering Discrete Mathematics and Combinatorics Mathematics Computer Science::Information Theory Computer Science - Discrete Mathematics
Zdroj:	Beelen, P, Glynn, D, Høholdt, T & Kaipa, K 2017, ' Counting generalized Reed-Solomon codes ', Advances in Mathematics of Communication, vol. 11, no. 4, pp. 777--790 . https://doi.org/10.3934/amc.2017057
DOI:	10.3934/amc.2017057
Popis:	In this article we count the number of generalized Reed-Solomon (GRS) codes of dimension k and length n, including the codes coming from a non-degenerate conic plus nucleus. We compare our results with known formulae for the number of 3-dimensional MDS codes of length n=6,7,8,9.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9401e11283e39698d09acf07aca8539b http://arxiv.org/abs/1611.04341 Zobrazit plný text záznamu