paper

Codes and Orbit Covers of Finite Abelian Groups

arXiv:2306.15387

Abstract

It is well known that the discrete analogue of a lattice is a linear code which is a vector subspace of Hamming space . The set is a finite field and . Our attempt is to construct a class of lattices such that its discrete analogues are variable length non-linear codes. Let and be two finite groups, and let be a fixed set of generators for . The homomorphism code is defined as the set of all homomorphisms from to , denoted by, . To each homomorphism between and , a codeword is associated, it is a vector of values of on the generators in , that is, , where is the image of , . We provide a design to construct a variable length binary non-linear code called as automorphism orbit code from a finite abelian -group of rank more than 1, where is a prime number. For each finite abelian -group, the codewords of the automorphism orbit code are variable length codewords called as automorphism orbit codewords. Note that homomorphism codes are determined by homomorphisms between groups, whereas automorphism orbit codes are specified by partitions of a number, orbits of a group action, homomorphisms and automorphisms of groups. We make use of elements of to present a cover relation for bit strings of codewords of an automorphism orbit code and formulate a lattice of variable length non-linear codes. Finally, we discuss some information related to the future research work on connections to representation theory of groups and algebras.

arXiv commentAfter few discussions with one of the experts in this area of research we made lots of changes in the upcoming version of the manuscript that includes change of authors, title, abstract and improvements in the whole manuscript. It was decided by both the authors (me and the expert) that this version of the manuscript must be withdrawn from the arXiv