An explicit representation and enumeration for negacyclic codes of length 2^kn over Z_4+uZ_4

11/27/2018
by   Yonglin Cao, et al.
0

In this paper, an explicit representation and enumeration for negacyclic codes of length 2^kn over the local non-principal ideal ring R=Z_4+uZ_4 (u^2=0) is provided, where k, n are any positive integers and n is odd. As a corollary, all distinct negacyclic codes of length 2^k over R are listed precisely. Moreover, a mass formula for the number of negacyclic codes of length 2^kn over R is given and a mistake in [Cryptogr. Commun. (2017) 9: 241--272] is corrected.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/08/2019

Explicit representation for a class of Type 2 constacyclic codes over the ring F_2^m[u]/〈 u^2λ〉 with even length

Let F_2^m be a finite field of cardinality 2^m, λ and k be integers sati...
research
02/28/2018

Negacyclic codes over the local ring Z_4[v]/〈 v^2+2v〉 of oddly even length and their Gray images

Let R=Z_4[v]/〈 v^2+2v〉=Z_4+vZ_4 (v^2=2v) and n be an odd positive intege...
research
11/27/2018

An explicit representation and enumeration for self-dual cyclic codes over F_2^m+uF_2^m of length 2^s

Let F_2^m be a finite field of cardinality 2^m and s a positive integer....
research
04/29/2021

Variable-Length Codes Independent or Closed with respect to Edit Relations

We investigate inference of variable-length codes in other domains of co...
research
07/19/2020

An explicit expression for Euclidean self-dual cyclic codes of length 2^k over Galois ring GR(4,m)

For any positive integers m and k, existing literature only determines t...
research
09/22/2018

The Maximum Length of Circuit Codes With Long Bit Runs and a New Characterization Theorem

We study circuit codes with long bit runs (sequences of distinct transit...
research
05/03/2021

Enumeration of parallelogram polycubes

In this paper, we enumerate parallelogram polycubes according to several...

Please sign up or login with your details

Forgot password? Click here to reset