Complete weight enumerators of a class of linear codes over finite fields | Zendy

Shudi Yang | Zendy; Xiangli Kong | Zendy; Xueying Shi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Complete weight enumerators of a class of linear codes over finite fields

Author(s) -

Shudi Yang,

Xiangli Kong,

Xueying Shi

Publication year - 2019

Publication title -

advances in mathematics of communications

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.601

H-Index - 26

eISSN - 1930-5346

pISSN - 1930-5338

DOI - 10.3934/amc.2020045

Subject(s) - mathematics , class (philosophy) , secret sharing , combinatorics , finite field , discrete mathematics , set (abstract data type) , cryptography , algorithm , computer science , artificial intelligence , programming language

We investigate a class of linear codes by choosing a proper defining set and determine their complete weight enumerators and weight enumerators. These codes have at most three weights and some of them are almost optimal so that they are suitable for applications in secret sharing schemes. This is a supplement of the results raised by Wang et al. (2017) and Kong et al. (2019).

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research