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

DOI10.1109/TIT.2021.3068743zbMath1475.94192arXiv2006.12395OpenAlexW3145381334MaRDI QIDQ5001790

Tor Helleseth, Longjiang Qu, Kangquan Li, Chunlei Li

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)

Related Items (6)

Generalized Hamming weights of linear codes from cryptographic functions ⋮ Bounds for the sum of distances of spherical sets of small size ⋮ Further projective binary linear codes derived from two-to-one functions and their duals ⋮ Two-to-one mappings and involutions without fixed points over \(\mathbb{F}_{2^n}\) ⋮ Several classes of linear codes with few weights from the closed butterfly structure ⋮ Characterizations and constructions of \(n\)-to-1 mappings over finite fields

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