  Boolean functions have important applications in cryptography and coding
theory. Two famous classes of binary codes derived from Boolean functions are
the Reed-Muller codes and Kerdock codes. In the past two decades, a lot of
progress on the study of applications of Boolean functions in coding theory has
been made. Two generic constructions of binary linear codes with Boolean
functions have been well investigated in the literature. The objective of this
paper is twofold. The first is to provide a survey on recent results, and the
other is to propose open problems on one of the two generic constructions of
binary linear codes with Boolean functions. These open problems are expected to
stimulate further research on binary linear codes from Boolean functions.
