Optimal three-weight cubic codes

MaRDI QIDQ5237820zbMATH OpenFDO

Authors Minjia Shi, Hongwei Zhu, Patrick Solé

Publication date 25 October 2019

Full work available at URL https://arxiv.org/abs/1612.00123, http://acmij.az/view.php?lang=az&menu=journal&id=474

zbMATH Keywords

Griesmer boundsecret sharing schemesthree-weight codestrace codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Authentication, digital signatures and secret sharing (94A62) Linear codes (general theory) (94B05) Cyclic codes (94B15)

Abstract: In this paper, we construct an infinite family of three-weight binary codes from linear codes over the ring $R=mathbb{F}_2+vmathbb{F}_2+v^{2}mathbb{F}_2$, where $v^3=1.$ These codes are defined as trace codes. They have the algebraic structure of abelian codes. Their Lee weight distributions are computed by employing character sums. The three-weight binary linear codes which we construct are shown to be optimal when $m$ is odd and $m>1$. They are cubic, that is to say quasi-cyclic of co-index three. An application to secret sharing schemes is given.

Recommendations

• Two-weight and three-weight codes from trace codes over \(\mathbb{F}_p + u \mathbb{F}_p + v \mathbb{F}_p + u v \mathbb{F}_p\)
• Two and three weight codes over \(\mathbb {F}_p+u\mathbb {F}_p\)
• Optimal binary codes from trace codes over a non-chain ring
• Few-weight codes from trace codes over a local ring
• New classes of \(p\)-ary few weight codes

Cited in

(16)

• Two-weight and three-weight codes from trace codes over \(\mathbb{F}_p + u \mathbb{F}_p + v \mathbb{F}_p + u v \mathbb{F}_p\)
• New \(\mathbb{Z}_4\) codes from constacyclic codes over a non-chain ring
• Linear codes with one-dimensional hull associated with Gaussian sums
• A class of constacyclic codes and skew constacyclic codes over \(\mathbb{Z}_{2^s}+u\mathbb{Z}_{2^s}\) and their Gray images
• Few-weight \(\mathbb{Z}_p\mathbb{Z}_p[u]\)-additive codes from down-sets
• Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal Gray image
• New classes of binary few weight codes from trace codes over a chain ring
• Three-weight minimal linear codes
• Linear codes over finite rings are trace codes
• scientific article; zbMATH DE number 3871188 (Why is no real title available?)
• Optimal binary codes from trace codes over a non-chain ring
• Two and three weight codes over \(\mathbb {F}_p+u\mathbb {F}_p\)
• A family of cyclic codes with two zeros
• Five-weight codes from three-valued correlation of M-sequences
• Two families of strongly walk regular graphs from three-weight codes over \(\mathbb{Z}_4 \)
• Lee weight distributions of trace codes over \(\mathbb{F}_q + u\mathbb{F}_q\) from irreducible cyclic codes

This page was built for publication: Optimal three-weight cubic codes

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