List decoding group homomorphisms between supersolvable groups

DOI10.4230/LIPICS.APPROX-RANDOM.2014.737MaRDI QIDQ2969659zbMATH OpenFDO

Authors Alan Guo, Madhu Sudan

Publication date 22 March 2017

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

zbMATH Keywords

error-correcting codesgroup theorylocally decodable codes

Mathematics Subject Classification ID

Decoding (94B35) Other types of codes (94B60)

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 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.

Recommendations

• List-decoding homomorphism codes with arbitrary codomains
• scientific article; zbMATH DE number 4033986
• On supersolvability of finite groups
• On the supersolvability of finite groups
• On the supersolvability of finite groups
• On the supersolvablity of finite groups
• scientific article; zbMATH DE number 3897202
• Computing Irreducible Representations of Supersolvable Groups
• scientific article; zbMATH DE number 4047936
• scientific article; zbMATH DE number 1046428

Cited in

(2)

• Group homomorphisms as error correcting codes
• List-decoding homomorphism codes with arbitrary codomains

This page was built for publication: List decoding group homomorphisms between supersolvable groups

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