An explicit formula for a weight enumerator of linear-congruence codes

MaRDI QIDQ3387171zbMATH OpenFDO

Authors

Publication date 12 January 2021

Full work available at URL https://arxiv.org/abs/1808.09365, http://www.the-ica.org/Volumes/90/Reprints/BICA2020-07-Reprint.pdf

zbMATH Keywords

code sizeexponential sumlinear-congruence codeweight enumerator

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Exponential sums (11T23) Other types of codes (94B60)

Abstract: An explicit formula for a weight enumerator of linear-congruence codes is provided. This extends the work of Bibak and Milenkovic [IEEE ISIT (2018) 431-435] addressing the binary case to the non-binary case. Furthermore, the extension simplifies their proof and provides a complete solution to a problem posed by them.

Recommendations

• Complete weight enumerators of a family of three-weight linear codes
• Complete weight enumerators of a class of three-weight linear codes
• Identities and approximations for the weight distribution of q-ary codes
• Some results on the weight distribution of linear codes

Cited in

(4)

• A basic exact sequence for the Lee and Euclidean weights of linear codes over \(\mathbb{Z}_l\)
• Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes
• scientific article; zbMATH DE number 3854967 (Why is no real title available?)
• scientific article; zbMATH DE number 7558354 (Why is no real title available?)

This page was built for publication: An explicit formula for a weight enumerator of linear-congruence codes

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