Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2014.737
URN: urn:nbn:de:0030-drops-47359
URL: https://drops.dagstuhl.de/opus/volltexte/2014/4735/
Guo, Alan ; Sudan, Madhu
List Decoding Group Homomorphisms Between Supersolvable Groups
| pdf-format: |
|
Abstract
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.
BibTeX - Entry
@InProceedings{guo_et_al:LIPIcs:2014:4735,
author = {Alan Guo and Madhu Sudan},
title = {{List Decoding Group Homomorphisms Between Supersolvable Groups}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {737--747},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Klaus Jansen and Jos{\'e} D. P. Rolim and Nikhil R. Devanur and Cristopher Moore},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2014/4735},
URN = {urn:nbn:de:0030-drops-47359},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.737},
annote = {Keywords: Group theory, error-correcting codes, locally decodable codes}
}
| Keywords: | Group theory, error-correcting codes, locally decodable codes | |
| Seminar: | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014) | |
| Issue date: | 2014 | |
| Date of publication: | 04.09.2014 |
