Group homomorphisms as error correcting codes

MaRDI QIDQ490299zbMATHFDO

Authors Alan Guo

Publication date 22 January 2015

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

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

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

zbMATH Keywords

minimum distancesolvable groupserror correcting codesgroup homomorphisms

Mathematics Subject Classification ID

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

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

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

Cites work

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

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)