Abstract

We study trace codes with defining set L,L, a subgroup of the multiplicative group of an extension of degree mm of the alphabet ring F3+uF3+u2F3,\mathbb{F}_3+u\mathbb{F}_3+u^{2}\mathbb{F}_{3}, with u3=1.u^{3}=1. These codes are abelian, and their ternary images are quasi-cyclic of co-index three (a.k.a. cubic codes). Their Lee weight distributions are computed by using Gauss sums. These codes have three nonzero weights when mm is singly-even and ∣L∣=33m−32m2.|L|=\frac{3^{3m}-3^{2m}}{2}. When mm is odd, and ∣L∣=33m−32m2|L|=\frac{3^{3m}-3^{2m}}{2}, or ∣L∣=33m−32m|L|={3^{3m}-3^{2m}} and mm is a positive integer, we obtain two new infinite families of two-weight codes which are optimal. Applications of the image codes to secret sharing schemes are also given.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.