%0 Conference Paper %1 8437645 %A Senger, C. %A Bohara, R. %B 2018 IEEE International Symposium on Information Theory (ISIT) %D 2018 %K myown from:christiansenger %P 6-10 %R 10.1109/ISIT.2018.8437645 %T A Linear Algebraic Approach to Subfield Subcodes of GRS Codes %U https://ieeexplore.ieee.org/document/8437645 %X 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.

@inproceedings{8437645, 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.}, added-at = {2020-03-10T17:15:44.000+0100}, author = {{Senger}, C. and {Bohara}, R.}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/23cbd8392df1ea94840feccf04ff05aba/inue}, booktitle = {2018 IEEE International Symposium on Information Theory (ISIT)}, description = {A Linear Algebraic Approach to Subfield Subcodes of GRS Codes - IEEE Conference Publication}, doi = {10.1109/ISIT.2018.8437645}, interhash = {0d35af4b1163c21787df6f9ff221007e}, intrahash = {3cbd8392df1ea94840feccf04ff05aba}, issn = {2157-8117}, keywords = {myown from:christiansenger}, month = {June}, pages = {6-10}, timestamp = {2020-03-10T16:15:44.000+0100}, title = {A Linear Algebraic Approach to Subfield Subcodes of GRS Codes}, url = {https://ieeexplore.ieee.org/document/8437645}, year = 2018 }