A construction of linear codes and their complete weight enumerators

DOI10.1016/J.FFA.2017.08.001MaRDI QIDQ2406684zbMATH OpenOpenAlexFDO

Authors Shudi Yang, Xiangli Kong, Chun-Ming Tang

Publication date 5 October 2017

Published in Finite Fields and their Applications (Search for Journal in Brave)

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

zbMATH Keywords

Gauss sum linear code cyclotomic number complete weight enumerator

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Exponential sums (11T23)

Abstract: Recently, linear codes constructed from defining sets have been studied extensively. They may have nice parameters if the defining set is chosen properly. Let

m > 2

be a positive integer. For an odd prime

p

, let

r = p^{m}

and

e x t T r

be the absolute trace function from

m a t h b b F_{r}

onto

m a t h b b F_{p}

. In this paper, we give a construction of linear codes by defining the code

C_{D} = (m a t h r m T r (a x))_{x i n D} : a i n m a t h b b F_{r},

where

D = l e f t x i n m a t h b b F_{r} : m a t h r m T r (x) = 1, m a t h r m T r (x^{2}) = 0 i g h t .

Its complete weight enumerator and weight enumerator are determined explicitly by employing cyclotomic numbers and Gauss sums. In addition, we obtain several optimal linear codes with a few weights. They have higher rate compared with other codes, which enables them to have essential applications in areas such as association schemes and secret sharing schemes.

Recommendations

Cites work

Cited in

(31)

This page was built for publication: A construction of linear codes and their complete weight enumerators

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