  This paper is concerned with list decoding of $2$-interleaved binary
alternant codes. The principle of the proposed algorithm is based on a
combination of a list decoding algorithm for (interleaved) Reed-Solomon codes
and an algorithm for (non-interleaved) alternant codes. A new upper bound on
the decoding radius is derived and the list size is shown to scale polynomially
in the code parameters. While it remains an open problem whether this upper
bound is achievable, the provided simulation results show that a decoding
radius exceeding the binary Johnson radius can be achieved with a high
probability of decoding success by the proposed algorithm.
