A tight upper bound on the number of non-zero weights of a constacyclic code

by   Hanglong Zhang, et al.

For a simple-root λ-constacyclic code 𝒞 over 𝔽_q, let ⟨ρ⟩ and ⟨ρ,M⟩ be the subgroups of the automorphism group of 𝒞 generated by the cyclic shift ρ, and by the cyclic shift ρ and the scalar multiplication M, respectively. Let N_G(𝒞^∗) be the number of orbits of a subgroup G of automorphism group of 𝒞 acting on 𝒞^∗=𝒞\{0}. In this paper, we establish explicit formulas for N_⟨ρ⟩(𝒞^∗) and N_⟨ρ,M⟩(𝒞^∗). Consequently, we derive a upper bound on the number of nonzero weights of 𝒞. We present some irreducible and reducible λ-constacyclic codes, which show that the upper bound is tight. A sufficient condition to guarantee N_⟨ρ⟩(𝒞^∗)=N_⟨ρ,M⟩(𝒞^∗) is presented.


page 1

page 2

page 3

page 4

∙ 11/07/2022

A tight upper bound on the number of non-zero weights of a quasi-cyclic code

Let 𝒞 be a quasi-cyclic code of index l(l≥2). Let G be the subgroup of t...
∙ 05/24/2023

Improved upper bounds on the number of non-zero weights of cyclic codes

Let C be an arbitrary simple-root cyclic code and let G be the subgroup ...
∙ 12/17/2018

Shifted varieties and discrete neighborhoods around varieties

For an affine variety X defined over a finite prime field F_p and some i...
∙ 07/13/2023

A Novel Bayes' Theorem for Upper Probabilities

In their seminal 1990 paper, Wasserman and Kadane establish an upper bou...
∙ 03/05/2019

Fractional cross intersecting families

Let A={A_1,...,A_p} and B={B_1,...,B_q} be two families of subsets of [n...
∙ 01/19/2021

Trading Transforms of Non-weighted Simple Games and Integer Weights of Weighted Simple Games

This paper is concerned with simple games. One of the fundamental questi...
∙ 12/16/2022

An Upper Bound for the Distribution Overlap Index and Its Applications

This paper proposes an easy-to-compute upper bound for the overlap index...

Please sign up or login with your details

Forgot password? Click here to reset