Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Propelinear structure of Z_{2k}-linear codes (0907.5287v1)

Published 30 Jul 2009 in cs.IT and math.IT

Abstract: Let C be an additive subgroup of $\Z_{2k}n$ for any $k\geq 1$. We define a Gray map $\Phi:\Z_{2k}n \longrightarrow \Z_2{kn}$ such that $\Phi(\codi)$ is a binary propelinear code and, hence, a Hamming-compatible group code. Moreover, $\Phi$ is the unique Gray map such that $\Phi(C)$ is Hamming-compatible group code. Using this Gray map we discuss about the nonexistence of 1-perfect binary mixed group code.

Citations (3)

Summary

We haven't generated a summary for this paper yet.