Deletion codes in the high-noise and high-rate regimes

DOI10.4230/LIPICS.APPROX-RANDOM.2015.867MaRDI QIDQ5351940zbMATH OpenFDO

Authors Carol J. Wang, Venkatesan Guruswami

Publication date 31 August 2017

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2015.867

zbMATH Keywords

algorithmic coding theorydeletion codesexplicit constructionslist decodingprobabilistic method

Mathematics Subject Classification ID

Other types of codes (94B60)

Recommendations

• An improved bound on the fraction of correctable deletions
• Efficiently decodable codes for the binary deletion channel
• Polynomial Time Low-Density Parity-Check Codes With Rates Very Close to the Capacity of the q-ary Random Deletion Channel for Large q
• Coding against deletions in oblivious and online models

Cited in

(6)

• Polynomial Time Low-Density Parity-Check Codes With Rates Very Close to the Capacity of the q-ary Random Deletion Channel for Large q
• An improved bound on the fraction of correctable deletions
• Coding against deletions in oblivious and online models
• Efficiently decodable codes for the binary deletion channel
• Optimally resilient codes for list-decoding from insertions and deletions
• Optimal Coding for the Binary Deletion Channel With Small Deletion Probability

This page was built for publication: Deletion codes in the high-noise and high-rate regimes

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