Linear codes with few weights from inhomogeneous quadratic functions

From MaRDI portal
Publication:521872

DOI10.1007/S10623-016-0267-7zbMATH Open1359.94389arXiv1602.01511OpenAlexW2293931389MaRDI QIDQ521872FDOQ521872


Authors: Chun-Ming Tang, Can Xiang, Keqin Feng Edit this on Wikidata


Publication date: 12 April 2017

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: Linear codes with few weights have been an interesting subject of study for many years, as these codes have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, linear codes with a few weights are constructed from inhomogeneous quadratic functions over the finite field gf(p), where p is an odd prime. They include some earlier linear codes as special cases. The weight distributions of these linear codes are also determined.


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




Recommendations




Cites Work


Cited In (20)





This page was built for publication: Linear codes with few weights from inhomogeneous quadratic functions

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