Two-weight and three-weight codes from trace codes over F_p + u F_p + v F_p + u v F_p

DOI10.1016/J.DISC.2017.09.003MaRDI QIDQ1685985zbMATH OpenOpenAlexFDO

Authors Yan Liu, Minjia Shi, Patrick Solé

Publication date 20 December 2017

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1612.00118

Gauss sum Griesmer bound secret sharing schemes weight distribution

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Authentication, digital signatures and secret sharing (94A62) Combinatorial codes (94B25)

Abstract: We construct an infinite family of two-Lee-weight and three-Lee-weight codes over the non-chain ring

m a t h b b F_{p} + u m a t h b b F_{p} + v m a t h b b F_{p} + u v m a t h b b F_{p},

where

u^{2} = 0, v^{2} = 0, u v = v u .

These codes are defined as trace codes. They have the algebraic structure of abelian codes. Their Lee weight distribution is computed by using Gauss sums. With a linear Gray map, we obtain a class of abelian three-weight codes and two-weight codes over

m a t h b b F_{p}

. In particular, the two-weight codes we describe are shown to be optimal by application of the Griesmer bound. We also discuss their dual Lee distance. Finally, an application to secret sharing schemes is given.

Recommendations

Cites work

Cited in

(25)

This page was built for publication: Two-weight and three-weight codes from trace codes over \(\mathbb{F}_p + u \mathbb{F}_p + v \mathbb{F}_p + u v \mathbb{F}_p\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1685985)