Boolean functions have important applications in cryptography and codingtheory. Two famous classes of binary codes derived from Boolean functions arethe Reed-Muller codes and Kerdock codes. In the past two decades, a lot ofprogress on the study of applications of Boolean functions in coding theory hasbeen made. Two generic constructions of binary linear codes with Booleanfunctions have been well investigated in the literature. The objective of thispaper is twofold. The first is to provide a survey on recent results, and theother is to propose open problems on one of the two generic constructions ofbinary linear codes with Boolean functions. These open problems are expected tostimulate further research on binary linear codes from Boolean functions.
展开▼
