DeepAI AI Chat
Log In Sign Up

On the number of non-G-equivalent minimal abelian codes

04/04/2019
by   Fatma Altunbulak Aksu, et al.
Msgsusosyalmedya
0

Let G be a finite abelian group. We prove that the number of non-G-equivalent minimal abelian codes is equal to number of divisors of the exponent of G if and only if for each prime p dividing the order of G, the Sylow p-subgroups of G are homocyclic.

READ FULL TEXT

page 1

page 2

page 3

01/17/2022

A characterization of abelian group codes in terms of their parameters

In 1979, Miller proved that for a group G of odd order, two minimal grou...
04/13/2020

A power APN function CCZ-equivalent to Kasami function in even dimension

Let n be an even number such that n≡ 0 4. We show that a power function ...
11/05/2019

An improved transformation between Fibonacci FSRs and Galois FSRs

Feedback shift registers (FSRs), which have two configurations: Fibonacc...
11/30/2020

On minimal subspace Zp-null designs

Let q be a power of a prime p, and let V be an n-dimensional space over ...
07/31/2018

On subgroups of minimal index

Let G be a group possessing a proper subgroup of finite index. We prove ...
11/20/2018

A Construction of Zero-Difference Functions

A function f from group (A,+) to group (B,+) is a (|A|, |Im(f)|, S) zero...
04/05/2022

The number of extended irreducible binary Goppa codes

Goppa, in the 1970s, discovered the relation between algebraic geometry ...