We try to simplify the set of all differences of odd $l$-digit binary numbers. Ignoring the first and last bits, because they are always $1$, we look at the differences of all numbers from the remaining $l-2$ digits, which is to say, numbers $1,2,\ldots,2^{l-2}$. Note, because we dropped the last digit, we must multiply our new result by $2$. Now, the sum, $S$, of all possible differences is
\begin{eqnarray*} S &=& 2\sum_{i=2}^{2^{l-2}} \sum_{j=1}^{i-1}{(i-j)} \\\ &=& 2\sum_{i=2}^{2^{l-2}} \sum_{j=1}^{i-1}{j} \\\ &=& \sum_{i=2}^{2^{l-2}}{(i^2 - i)} \\\ &=& \dfrac{1}{6} 2^{l-2} \left(2^{l-2}+1\right) \left(2^{l-1}+1\right) - \dfrac{1}{2} 2^{l-2} \left(2^{l-2}+1\right) \\\ \end{eqnarray*} using the Sum of Squares formula.
Now, the number, $N$ of these number-pairs, is
$$N=\binom{2^{l-2}}{2} = 2^{2l-5} - 2^{l-3}.$$
So the expected value is
$$\dfrac{S}{N} = \dfrac{2^{l-1}+2}{3}\qquad\text{after some tedious simplification.}$$