Random shortening of linear codes and applications

DOI10.1007/978-3-031-49193-1_14MaRDI QIDQ6591630zbMATH OpenFDO

Authors Xue Chen, Kuan Cheng, Xin Li, Songtao Mao

Publication date 22 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-49193-1_14

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius
• Constructions of low-degree and error-correcting -biased generators
• Every list-decodable code for high noise has abundant near-optimal rate puncturings
• Expander codes
• Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius
• scientific article; zbMATH DE number 3174791 (Why is no real title available?)
• Improved Decoding of Expander Codes
• List-Decodability With Large Radius for Reed-Solomon Codes
• On lattices, learning with errors, random linear codes, and cryptography
• On the Existence of Asymptotically Good Linear Codes in Minor-Closed Classes
• On the list decodability of random linear codes with large error rates
• Shortened Linear Codes Over Finite Fields

This page was built for publication: Random shortening of linear codes and applications

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