Proofs of several conjectures on linear codes from Boolean functions

DOI10.1016/j.disc.2018.10.022zbMath1417.94101OpenAlexW2901922344WikidataQ113877057 ScholiaQ113877057MaRDI QIDQ1625821

Faruk Göloğlu, Dáša Krasnayová

Publication date: 29 November 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2018.10.022

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Related Items (1)

Recent results and problems on constructions of linear codes from cryptographic functions

Cites Work

• A construction of binary linear codes from Boolean functions
• Almost perfect nonlinear trinomials and hexanomials
• Linear Codes From Some 2-Designs
• Some New Difference Sets

This page was built for publication: Proofs of several conjectures on linear codes from Boolean functions