Generalized Reed-Solomon codes over number fields and exact gradient coding
This paper describes generalized Reed-Solomon (GRS) codes over number fields that are invariant under certain permutations. We call these codes generalized quasi-cyclic (GQC) GRS codes. Moreover, we describe an application of GQC GRS codes over number fields to exact gradient coding.
Main Authors: | Irwansyah, Intan Muchtadi-Alamsyah, Fajar Yuliawan, Muhammad Irfan Hidayat |
---|---|
Format: | Article |
Language: | English |
Published: |
AIMS Press
2024-03-01
|
Series: | AIMS Mathematics |
Subjects: | |
Online Access: | https://aimspress.com/article/doi/10.3934/math.2024464?viewType=HTML |
Similar Items
-
Dimensions of the hull of generalized Reed-Solomon codes
by: Jing Huang, et al.
Published: (2024-04-01) -
SYNTHESIS AND ANALYSIS OF REED-SOLOMON CODES IN ISOMORPHIC SPACE OF IMAGES
by: A.J. Beletsky, et al.
Published: (2013-08-01) -
Evaluation of reed-solomon (R-S) coding performance for M-Ary modulation in AWGN and multipath fading channels /
by: 453470 Syed Mohd. Fairuz Syed Mohd. Dardin
Published: (2005) -
Evaluation of reed-solomon (R-S) coding performance for M-Ary modulation in AWGN and multipath fading channels [compact disc] /
by: 453470 Syed Mohd. Fairuz Syed Mohd. Dardin
Published: (2005) -
Repair of Reed-Solomon codes in the presence of erroneous nodes
by: Kruglik, Stanislav, et al.
Published: (2023)