A Linear Algebraic Approach to Subfield Subcodes of GRS Codes
Information Theory
2018-03-13 v1 math.IT
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.
Cite
@article{arxiv.1803.04028,
title = {A Linear Algebraic Approach to Subfield Subcodes of GRS Codes},
author = {Christian Senger and Rohit Bohara},
journal= {arXiv preprint arXiv:1803.04028},
year = {2018}
}