2000 character limit reached
On Codes Over $\mathbb{Z}_{p^{s}}$ with the Extended Lee Weight
Published 27 Jun 2014 in cs.IT and math.IT | (1407.2208v1)
Abstract: We consider codes over $\mathbb{Z}{ps}$ with the extended Lee weight. We find Singleton bounds with respect to this weight and define MLDS and MLDR codes accordingly. We also consider the kernels of these codes and the notion of independence of vectors in this space. We investigate the linearity and duality of the Gray images of codes over $\mathbb{Z}{ps}$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
