Polynomial Time Decodable Codes for the Binary Deletion Channel

DOI10.1109/TIT.2018.2876861zbMath1431.94148arXiv1705.01963OpenAlexW2895932209WikidataQ129058395 ScholiaQ129058395MaRDI QIDQ5223925

Ray Li, Venkatesan Guruswami

Publication date: 19 July 2019

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

Full work available at URL: https://arxiv.org/abs/1705.01963

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Related Items (1)

Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes

This page was built for publication: Polynomial Time Decodable Codes for the Binary Deletion Channel