Authors: Fernando Hernando Kyle Marshall Michael E O’Sullivan
Publish Date: 2012/03/01
Volume: 69, Issue: 1, Pages: 131-142
Abstract
Reed–Solomon RS codes are among the most ubiquitous codes due to their good parameters as well as efficient encoding and decoding procedures However RS codes suffer from having a fixed length In many applications where the length is static the appropriate length can be obtained from an RS code by shortening or puncturing Generalized Reed–Solomon GRS codes are a generalization of RS codes whose subfieldsubcodes SFSC are extensively studied In this paper we show that a particular class of GRS codes produces many SFSC with large dimension We present two algorithms for searching through these codes and a list of new bestknown codes obtained
Keywords: