A class of linear codes with a few weights

From MaRDI portal
Publication:502407

DOI10.1007/S12095-016-0200-YzbMATH Open1416.94067arXiv1512.07103OpenAlexW2286699583MaRDI QIDQ502407FDOQ502407


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


Publication date: 5 January 2017

Published in: Cryptography and Communications (Search for Journal in Brave)

Abstract: Linear codes have been an interesting subject of study for many years, as linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, a class of linear codes with a few weights over the finite field gf(p) are presented and their weight distributions are also determined, where p is an odd prime. Some of the linear codes obtained are optimal in the sense that they meet certain bounds on linear codes.


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




Recommendations




Cites Work


Cited In (17)

Uses Software





This page was built for publication: A class of linear codes with a few weights

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