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...
Main Authors: | Greaves, Gary, Syatriadi, Jeven |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Journal Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/143861 |
Similar Items
-
Repair of Reed-Solomon codes in the presence of erroneous nodes
by: Kruglik, Stanislav, et al.
Published: (2023) -
Decoding sparse Reed-Solomon codes with known support
by: Kim, Wilton, et al.
Published: (2024) -
Four new families of quantum stabilizer codes from hermitian self-orthogonal MDS codes
by: Sok, Lin, et al.
Published: (2024) -
On linear codes whose hermitian hulls are MDS
by: Luo, Gaojun, et al.
Published: (2024) -
Perturbed adaptive belief propagation decoding for high-density parity-check codes
by: Deng, Li, et al.
Published: (2023)