The Levenshtein's sequence reconstruction problem and the length of the list

DOI10.1109/TIT.2023.3318354MaRDI QIDQ6576022zbMATH OpenFDO

Authors Ville Junnila, Tero Laihonen, Tuomo Lehtilä

Publication date 22 July 2024

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

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

zbMATH Keywords

decodingerror-correcting codemajority algorithmtransmitted words

Mathematics Subject Classification ID

Decoding (94B35)

Cited in

(2)

• Levenshtein's sequence reconstruction problem and results for larger alphabet sizes
• Reconstructing graphs with subgraph compositions

This page was built for publication: The Levenshtein's sequence reconstruction problem and the length of the list

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