2000 character limit reached
A Linear Algebraic Approach to Subfield Subcodes of GRS Codes
Published 11 Mar 2018 in cs.IT and math.IT | (1803.04028v1)
Abstract: The problem of finding subfield subcodes of generalized Reed-Solomon (GRS) codes (i.e., alternant codes) is considered. A pure linear algebraic approach is taken in order to derive message constraints that generalize the well known conjugacy constraints for cyclic GRS codes and their Bose-Chaudhuri-Hocquenghem (BCH) subfield subcodes. It is shown that the presented technique can be used for finding nested subfield subcodes with increasing design distance.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.