Odd-defect list edge-colouring bound

Let $G$ be a graph, let $d$ be an odd integer, and let $ch'_d(G)$ denote its $d$-defective list chromatic index.

Odd-defect list edge-colouring conjecture. For every odd integer $d$ and for every graph $G$,

$$ch'_d(G) \leq \left\lceil \frac{3\Delta - 1}{3d-1} \right\rceil.$$

This is a proposed extension of the defective edge-colouring bound to list edge colouring; the source notes that the corresponding announced result has a flaw outside a divisibility condition, so the conjecture remains open.