Optimal RS codes and GRS codes against adversarial insertions and deletions and optimal constructions

DOI10.1109/TIT.2024.3398587MaRDI QIDQ6670127zbMATH OpenFDO

Authors Jingge Liu

Publication date 23 January 2025

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2024.3398587

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

Cited in

(1)

• Random Reed-Solomon codes achieve the half-singleton bound for insertions and deletions over linear-sized alphabets

This page was built for publication: Optimal RS codes and GRS codes against adversarial insertions and deletions and optimal constructions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6670127)