ZpZp2-additive cyclic codes: kernel and rank

Abstract

A code C = (C) is called Zp Zp2-linear if it's the Gray image of the Zp Zp2-additive code C. In this paper, the rank and the dimension of the kernel of C are studied. Both of the codes (C) and ((C)) are proven Zp Zp2-additive cyclic codes, and their generator polynomials are determined. Finally, accurate values of rank and the dimension of the kernel of some classes of Zp Zp2-additive cyclic codes are considered.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…