Few-weight quaternary codes via simplicial complexes

In this paper, we construct quaternary linear codes via simplicial complexes and we also determine the weight distributions of these codes. Moreover, we present an infinite family of minimal quaternary linear codes, which also meet the Griesmer bound.

Bibliographic Details
Main Authors: Xiaomeng Zhu, Yangjiang Wei
Format: Article
Language:English
Published: AIMS Press 2021-03-01
Series:AIMS Mathematics
Subjects:
Online Access:http://www.aimspress.com/article/doi/10.3934/math.2021303?viewType=HTML