2026-07-22T17:54:34Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:4735 2024-03-06T10:35:20Z ddc:004 open_access

List Decoding Group Homomorphisms Between Supersolvable Groups Guo, Alan Sudan, Madhu Group theory error-correcting codes locally decodable codes We show that the set of homomorphisms between two supersolvable groups can be locally list decoded up to the minimum distance of the code, extending the results of Dinur et al. (Proc. STOC 2008) who studied the case where the groups are abelian. Moreover, when specialized to the abelian case, our proof is more streamlined and gives a better constant in the exponent of the list size. The constant is improved from about 3.5 million to 105. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Alan Guo and Madhu Sudan 2014 Is Part Of LIPIcs, Volume 28, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.APPROX-RANDOM.2014.737 urn:nbn:de:0030-drops-47359 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.737 eng https://creativecommons.org/licenses/by/3.0/legalcode