$\prod\limits_{i=1}^{n} \mathbb{Z}_{2^i}$-Additive Cyclic Codes


In this paper we study n ∏ i=1 Z2i -Additive Cyclic Codes. These codes are identified as Z2n [x]submodules of n ∏ i=1 Z2i [x]/〈x αi − 1〉; αi and i being relatively prime for each i = 1, 2, . . . , n. We first define a n ∏ i=1 Z2i -additive cyclic code of a certain length. We then define the distance between two codewords and the minimum distance of such a… (More)


  • Presentations referencing similar topics