Group homomorphisms as error correcting codes
Author(s)Guo, Alan Xinyu
MetadataShow full item record
We investigate the minimum distance of the error correcting code formed by the homomorphisms between two finite groups G and H. We prove some general structural results on how the distance behaves with respect to natural group operations, such as passing to subgroups and quotients, and taking products. Our main result is a general formula for the distance when G is solvable or H is nilpotent, in terms of the normal subgroup structure of G as well as the prime divisors of │G│ and │H│. In particular, we show that in the above case, the distance is independent of the subgroup structure of H. We complement this by showing that, in general, the distance depends on the subgroup structure of H.
DepartmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Electronic Journal of Combinatorics
European Mathematical Information Service (EMIS)
Guo, Alan. "Group homomorphisms as error correcting codes." The Electronic Journal of Combinatorics 22(1) (2015), #P1.4.
Final published version