Reed–solomon codes over small fields with constrained generator matrices
We give constructions of some special cases of [n, k] Reed-Solomon codes over finite fields of size at least n and n + 1 whose generator matrices have constrained support. Furthermore, we consider a generalization of the GM-MDS conjecture proposed by Lovett in 2018. We show that Lovett's conjec...
Saved in:
Main Authors: | Greaves, Gary, Syatriadi, Jeven |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/143861 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Multistage list decoding of generalized Reed-Solomon codes over Galois rings
by: Armand, M.A., et al.
Published: (2014) -
Repair of Reed-Solomon codes in the presence of erroneous nodes
by: Kruglik, Stanislav, et al.
Published: (2023) -
Interleaved Reed-Solomon codes versus interleaved Hermitian codes
by: Armand, M.A.
Published: (2014) -
On transformed folded shortened reed-solomon codes for the correction of phased bursts
by: Jianwen, Z., et al.
Published: (2014) -
Development of a Reed-Solomon error detection and correction system
by: Africa, Aaron Don M., et al.
Published: (2020)