TY - GEN
T1 - Reed-Solomon Codes over Fields of Characteristic Zero
AU - Sippel, Carmen
AU - Ott, Cornelia
AU - Puchinger, Sven
AU - Bossert, Martin
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/7
Y1 - 2019/7
N2 - We study Reed-Solomon codes over arbitrary fields, inspired by several recent papers dealing with Gabidulin codes over fields of characteristic zero. Over the field of rational numbers, we derive bounds on the coefficient growth during encoding and the bit complexity of decoding, which is polynomial in the code length and in the bit width of error and codeword values. The results can be generalized to arbitrary number fields.
AB - We study Reed-Solomon codes over arbitrary fields, inspired by several recent papers dealing with Gabidulin codes over fields of characteristic zero. Over the field of rational numbers, we derive bounds on the coefficient growth during encoding and the bit complexity of decoding, which is polynomial in the code length and in the bit width of error and codeword values. The results can be generalized to arbitrary number fields.
UR - http://www.scopus.com/inward/record.url?scp=85073164388&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2019.8849332
DO - 10.1109/ISIT.2019.8849332
M3 - Conference contribution
AN - SCOPUS:85073164388
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1537
EP - 1541
BT - 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2019 IEEE International Symposium on Information Theory, ISIT 2019
Y2 - 7 July 2019 through 12 July 2019
ER -