Subfield-subcodes of generalized toric codes
F Hernando, ME O'Sullivan, E Popovici… - … on information theory, 2010 - ieeexplore.ieee.org
2010 IEEE international symposium on information theory, 2010•ieeexplore.ieee.org
We study subfield-subcodes of Generalized Toric (GT) codes over F p s. These are the
multidimensional analogues of BCH codes, which may be seen as subfield-subcodes of
generalized Reed-Solomon codes. 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.
multidimensional analogues of BCH codes, which may be seen as subfield-subcodes of
generalized Reed-Solomon codes. 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.
We study subfield-subcodes of Generalized Toric (GT) codes over F p s. These are the multidimensional analogues of BCH codes, which may be seen as subfield-subcodes of generalized Reed-Solomon codes. 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.
ieeexplore.ieee.org
Showing the best result for this search. See all results