  Lehmer's code gives a bijection between the symmetric group and the set of
staircase compositions. In this paper, we define a new poset for such
compositions and derive its equivalence with the strong Bruhat order of the
symmetric group. This is an intrinsic construction that does not require any
mention of the associated permutations.
