Binary Linear Codes With Few Weights From Two-to-One Functions

DOI10.1109/TIT.2021.3068743MaRDI QIDQ5001790zbMATH OpenOpenAlexFDO

Authors Kangquan Li, Chunlei Li, Tor Helleseth, Longjiang Qu

Publication date 23 July 2021

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2006.12395

zbMATH Keywords

sphere packing boundweight distributionsclasses of linear codes with few nonzero weightsconstructions of binary linear codesminimum distance of dual codetwo-to-one functions

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Abstract: In this paper, we apply two-to-one functions over $mathbb{F}_{2^n}$ in two generic constructions of binary linear codes. We consider two-to-one functions in two forms: (1) generalized quadratic functions; and (2) $left(x^{2^t}+xight{)}^e$ with $gcd(t,n)=1$ and $gcdleft(e,2^n-1ight)=1$. Based on the study of the Walsh transforms of those functions or their related-ones, we present many classes of linear codes with few nonzero weights, including one weight, three weights, four weights and five weights. The weight distributions of the proposed codes with one weight and with three weights are determined. In addition, we discuss the minimum distance of the dual of the constructed codes and show that some of them achieve the sphere packing bound. { Moreover, several examples show that some of our codes are optimal and some have the best known parameters.}

Cited in

(21)

• Parametric construction approach of balanced Boolean functions from two-to-one mappings
• Generalized Hamming weights of linear codes from cryptographic functions
• Two-to-one mappings and involutions without fixed points over \(\mathbb{F}_{2^n}\)
• Exceptional 2-to-1 rational functions
• The classifications of o-monomials and of 2-to-1 binomials are equivalent
• Binary linear codes from vectorial Boolean functions and their weight distribution
• Implicit functions over finite fields and their applications to good cryptographic functions and linear codes
• New dimension-independent upper bounds on linear insdel codes
• Characterizations and constructions of \(n\)-to-1 mappings over finite fields
• On the size of maximal binary codes with 2, 3, and 4 distances
• A class of cubic polynomial semi-bent functions over \(\mathbb{F}_{2^n}\)
• New constructions of 2-to-1 mappings over \(\mathbb{F}_{2^n}\) and their applications to binary linear codes
• Constructions of binary quantum CSS-T codes from some special functions
• Few-weight linear codes over \(\mathbb{F}_p\) from \(t\)-to-one mappings
• Several classes of linear codes with few weights from the closed butterfly structure
• Bounds for the sum of distances of spherical sets of small size
• Two classes of exceptional \(m\)-to-1 rational functions
• Complete classification of 3-to-1 quadrinomials of the form \(x^3(x^{3q-3} + bx^{2q-2} + cx^{q-1} + d)\in\mathbb{F}_q[x]\) on \(\mathbb{F}_{q^2}^\ast\)
• Further projective binary linear codes derived from two-to-one functions and their duals
• Linear codes with few weights from inhomogeneous quadratic functions
• On a class of \(m\)-to-1 functions

This page was built for publication: Binary Linear Codes With Few Weights From Two-to-One Functions

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