Corrections to "High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm"

In the above article, the authors propose d -ary SICTA and derive the expected conditional length of the collision resolution interval, optimal splitting probability and the maximum stable throughput (MST) for d \geq 2 under stationary ergodic packet arrivals. In this correction, we show that the premise of the analysis for d > 2 and consequentially the results presented for d > 2 do not hold.