A lower bound on the size of the largest metrically regular subset of the Boolean cube

DOI10.1007/s12095-018-0326-1zbMath1456.94102OpenAlexW2892231032MaRDI QIDQ2311430

Alexey Oblaukhov

Publication date: 10 July 2019

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-018-0326-1

zbMATH Keywords

bent functionBoolean cubemetric complementmetrically regular setstrongly metrically regular set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) General topics of discrete mathematics in relation to computer science (68R01) Cryptography (94A60) Boolean functions (94D10)

Related Items (5)

On metric regularity of Reed-Muller codes ⋮ METRICAL PROPERTIES OF THE SET OF BENT FUNCTIONS IN VIEW OF DUALITY ⋮ ON METRIC COMPLEMENTS AND METRIC REGULARITY IN FINITE METRIC SPACES ⋮ Metrical properties of self-dual bent functions ⋮ Linear codes and incidence structures of bent functions and their generalizations

Cites Work

• Duality between bent functions and affine functions
• Completely regular codes
• On ``bent functions
• Metric complements to subspaces in the Boolean cube
• MATHEMATICAL METHODS IN SOLUTIONS OF THE PROBLEMS PRESENTED AT THE THIRD INTERNATIONAL STUDENTS’ OLYMPIAD IN CRYPTOGRAPHY
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A lower bound on the size of the largest metrically regular subset of the Boolean cube