Propelinear structure of Z2k-linear codes
Abstract
Let C be an additive subgroup of 2kn for any k≥ 1. We define a Gray map :2kn 2kn such that () is a binary propelinear code and, hence, a Hamming-compatible group code. Moreover, is the unique Gray map such that (C) is Hamming-compatible group code. Using this Gray map we discuss about the nonexistence of 1-perfect binary mixed group code.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.