A class of ternary codes with few weights

DOI10.1007/S10623-025-01605-ZMaRDI QIDQ6944939zbMATH OpenFDO

Authors Kaimin Cheng

Publication date 11 August 2025

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

Full work available at URL https://doi.org/10.1007/S10623-025-01605-Z

zbMATH Keywords

exponential sumslinear codesoptimal codesweight distributionWeil bound

Mathematics Subject Classification ID

Exponential sums (11T23) Linear codes (general theory) (94B05)

Cites work

• A coding theory construction of new systematic authentication codes
• A note on evaluations of some exponential sums
• Codes for error detection.
• Cyclotomic Linear Codes of Order 3
• Evaluation of some exponential sums over a finite field
• Explicit evaluation of certain exponential sums.
• Explicit evaluation of some exponential sums
• Explicit evaluations of some Weil sums
• Exponential sums over finite fields
• Fundamentals of Error-Correcting Codes
• How to build robust shared control systems
• Improvements of \(p\)-adic estimates of exponential sums
• Linear Codes From Some 2-Designs
• Linear codes with few weights from inhomogeneous quadratic functions
• The Geometry of Two-Weight Codes
• Variations of \(p\)-adic Newton polygons for \(L\)-functions of exponential sums

Cited in

(1)

• On binomial Weil sums and an application

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

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