Schur ring and Codes for S-subgroups over 2n

Abstract

In this paper the relationship between S-subgroups in 2n and binary codes is shown. If the codes used are both P(T)-codes and G-codes, then the S-subgroup is free. The codes constructed are cyclic, decimated or symmetric and the S-subgroups obtained are free under the action the cyclic permutation subgroup, invariants under the action the decimated permutation subgroup and symmetric under the action of symmetric permutation subgroup, respectively. Also it is shows that there is no codes generating whole 2n in any n(a)-complete S-set of the S-ring S(2n,Sn).

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…