  J. Y. Hyun, et al. (Des. Codes Cryptogr., vol. 88, pp. 2475-2492, 2020)
constructed some optimal and minimal binary linear codes generated by one or
two order ideals in hierarchical posets of two levels. At the end of their
paper, they left an open problem: it also should be interesting to investigate
the cases of more than two orders in hierarchical posets with two levels or
many levels. In this paper, we use the geometric method to determine the
minimality of linear codes generated by any orders in hierarchical posets with
two levels. We generalize their cases of one or two orders to any orders and
determine the minimality of the linear codes completely.
