We prove that the noncrossing partition lattices associated with the complex reflection groups G (d, d, n) for d, n ≥ 2 admit symmetric decompositions into Boolean subposets. As a result, these lattices have the strong Sperner property and their rank-generating polynomials are symmetric, unimodal, and γ-nonnegative. We use computer computations to complete the proof that every noncrossing partition lattice associated with a well-generated complex reflection group is strongly Sperner, thus answering affirmatively a question raised by D. Armstrong.2010 Mathematics Subject Classification. 06A07 (primary), and 20F55 (secondary).