Subfield-subcodes of Generalized Toric codes

Research output: Chapter in Book/Report/Conference proceedingsConference proceedingpeer-review

Abstract

We study subfield-subcodes of Generalized Toric (GT) codes over F ps. These are the multidimensional analogues of BCH codes, which may be seen as subfield-subcodes of generalized Reed-Solomon codes [2], [3], [6], [10], [11]. We identify polynomial generators for subfield-subcodes of GT codes which allows us to determine the dimensions and obtain bounds for the minimum distance. We give several examples of binary and ternary subfield-subcodes of GT codes that are the best known codes of a given dimension and length.

Original languageEnglish
Title of host publication2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
Pages1125-1129
Number of pages5
DOIs
Publication statusPublished - 2010
Externally publishedYes
Event2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States
Duration: 13 Jun 201018 Jun 2010

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8103

Conference

Conference2010 IEEE International Symposium on Information Theory, ISIT 2010
Country/TerritoryUnited States
CityAustin, TX
Period13/06/1018/06/10

Fingerprint

Dive into the research topics of 'Subfield-subcodes of Generalized Toric codes'. Together they form a unique fingerprint.

Cite this