New bounds for codes over Gaussian integers based on the Mannheim distance

Read full text Summarise with VIRAT
Authors: Minjia Shi, Xuan Wang, Junmin An, Jon-Lark Kim
Cited by: 0
References: 31

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

We study linear codes over Gaussian integers equipped with the Mannheim distance. We develop Mannheim-metric analogues of several classical bounds. We derive an explicit formula for the volume of Mannheim balls, which yields a sphere packing bound and constraints on the parameters of two-error-correcting perfect codes. We prove several other useful bounds, and exhibit families of codes meeting these bounds for some parameters, thereby showing that these bounds are tight. We also discuss self-dual codes over Gaussian integers and obtain upper bounds on their minimum Mannheim distance for certain parameter regions using a Mannheim version of the Macwilliams-type identity. Finally, we present decoding algorithms for codes over Gaussian integer residue rings. We give examples showing that certain errors which are not correctable under the Hamming metric become correctable under the Mannheim metric.

Fields of Study & Subjects

Coding theory and cryptography Cryptography and Residue Arithmetic Error Correcting Code Techniques

Publication details

Journal / source
arXiv (Cornell University)
Publication date
26 March 2026
Language
EN
Document type
Preprint