ā„¤_pā„¤_p^2-additive cyclic codes: kernel and rank

06/28/2022
āˆ™
by   Xuan Wang, et al.
āˆ™
0
āˆ™

A code C = Ī¦(š’ž) is called ā„¤_p ā„¤_p^2-linear if it's the Gray image of the ā„¤_p ā„¤_p^2-additive code š’ž. In this paper, the rank and the dimension of the kernel of š’ž are studied. Both of the codes āŸØĪ¦(š’ž) āŸ© and (Ī¦(š’ž)) are proven ā„¤_p ā„¤_p^2-additive cyclic codes, and their generator polynomials are determined. Finally, accurate values of rank and the dimension of the kernel of some classes of ā„¤_p ā„¤_p^2-additive cyclic codes are considered.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset