article
Open access
Few-weight quaternary codes via simplicial complexes
Research footprint
At a glance
- Citations
- 11
- References
- 14
- Comments
- 0
Paper overview
Abstract
<abstract> 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. </abstract>
Record transparency
Publication details
- DOI
- 10.3934/math.2021303
- OpenAlex
- W3138473808
- Document type
- article
- Language
- EN
- Source
- AIMS Mathematics
- Last metadata update
Comments
Log in to join the discussion.