2000 character limit reached
Reversible complement cyclic codes over finite chain rings
Published 1 Aug 2023 in cs.IT and math.IT | (2308.00642v1)
Abstract: Let k be an arbitrary element of a finite commutative chain ring R and u be a unit in R. In this work, we present necessary conditions which are sufficient as well for a cyclic code to be a (u,k) reversible complement code over R. Using these conditions, all principally generated cyclic codes over the ring Z_{2}+vZ_{2}+v{2}Z_{2}, v{3}=0 of length 4 have been checked to find whether they are (1,1) reversible complement or not.
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.