Hardness of linear index coding on perturbed instances

DOI10.1109/TIT.2023.3347296MaRDI QIDQ6576041zbMATH OpenFDO

Authors Dror Chawin, Ishay Haviv

Publication date 22 July 2024

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

zbMATH Keywords

computational complexitycomputationally hardminrank parameter on perturbed instances

Mathematics Subject Classification ID

Source coding (94A29)

This page was built for publication: Hardness of linear index coding on perturbed instances

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