Additive codes with few weights

Additive codes have a wide range of applications. A classical nice and generic way to construct linear codes is via trace functions. In this paper, first, we generalize this method to construct additive codes. Then, we use this method to get some explicit additive codes. Computing Weil-like sums, we...

Full description

Saved in:
Bibliographic Details
Published in:Cryptography and communications 2024, Vol.16 (5), p.1077-1102
Main Authors: Panario, Daniel, Sahin, Murat, Wang, Qiang
Format: Article
Language:English
Subjects:
Circuits
Coding and Information Theory
Communications Engineering
Computer Science
Data Structures and Information Theory
Information and Communication
Mathematics of Computing
Networks
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Additive codes have a wide range of applications. A classical nice and generic way to construct linear codes is via trace functions. In this paper, first, we generalize this method to construct additive codes. Then, we use this method to get some explicit additive codes. Computing Weil-like sums, we obtain parameters of these codes such as the length and weight distribution. We show that our codes have few weights.
ISSN:1936-2447
1936-2455
DOI:10.1007/s12095-024-00720-3