Group homomorphisms as error correcting codes

zbMATH Open1333.94069arXiv1404.3447MaRDI QIDQ490299FDOQ490299

Authors: Alan Guo 

Publication date: 22 January 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: 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 $G$.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• List decoding group homomorphisms between supersolvable groups
• On the Hamming distance properties of group codes
• Group geometries and error-correcting codes.
• scientific article; zbMATH DE number 5588563
• Code distances of some classes of \((p,p)\)-codes

zbMATH Keywords

minimum distancesolvable groupserror correcting codesgroup homomorphisms

Mathematics Subject Classification ID

Combinatorial codes (94B25) Special aspects of infinite or finite groups (20F99)

Cites Work

• Title not available (Why is that?)
• Error detecting and error correcting codes
• List-decoding multiplicity codes
• Finite group theory.
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Decoding of Reed Solomon codes beyond the error-correction bound
• Subspace evasive sets
• Title not available (Why is that?)
• On the Sylow Systems of a Soluble Group^†
• Title not available (Why is that?)
• Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
• List decoding group homomorphisms between supersolvable groups
• Optimal Rate List Decoding via Derivative Codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Local Decoding and Testing for Homomorphisms
• A Fourier-Analytic Approach to Reed–Muller Decoding

This page was built for publication: Group homomorphisms as error correcting codes

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