A new scheme for enumerating the legal bidding sequences in bridge is developed for various constraints on the allowed bids. It is shown that such bidding sequences can be represented by fixed length strings from a

-ary alphabet and that all such strings represent bidding sequences.