Elsevier

Discrete Mathematics

Volume 340, Issue 9, September 2017, Pages 2262-2274
Discrete Mathematics

A construction of linear codes and strongly regular graphs from q-polynomials

https://doi.org/10.1016/j.disc.2017.04.016Get rights and content
Under an Elsevier user license
open archive

Abstract

Linear codes with few weights have applications in secret sharing, authentication codes, association schemes, data storage systems, strongly regular graphs and some other fields. Two-weight linear codes are particularly interesting since they are closely related to finite geometry, combinatorial designs, graph theory. In this paper, we present a new approach to constructing linear codes with two or three weights from q-polynomials and study their weight distributions. As an application of two-weight linear codes, we obtain three families of strongly regular graphs. Some of the presented strongly regular graphs are new.

Keywords

Linear code
Strongly regular graph
q-polynomial
Niho exponent
Weight distribution

Cited by (0)

This work was supported by the National Natural Science Foundation of China (Grant Nos. 11371011 and 61572027).