A channel with multiplicity feedback in case of collision returns the exact number of stations simultaneously transmitting. In this model, $\mathrm{\Theta }((d\log (n/d))/\log d)$ time rounds are sufficient and necessary to identify d transmitting stations out of n. In contrast, in the ternary feedback model the time complexity is $\mathrm{\Theta }(d\log (n/d))$. Generalizing, we can define a feedback interval $[x,y]$, where $0\le x\le y\le d$, such that the channel returns the exact number of transmitting stations only if this number is within that interval. For a feedback interval centered in $d/2$ we show that it is possible to get the same optimal time complexity for the channel with multiplicity feedback even if the interval has only size $O(\sqrt{d\log d})$. On the other hand, if we further reduce the size to $O\left(\frac{\sqrt{d}}{\log d}\right)$, then we show that no protocol having time complexity $\mathrm{\Theta }((d\log (n/d))/(\log d))$ is possible.

发生冲突时具有多重反馈的信道返回同时发送的确切站数。在这个模型中$\mathrm{\Theta }（（d\mathrm{日志}（ñ/d））/\mathrm{日志}d）$时间周期足以确定n个中的d个发射站。相反，在三元反馈模型中，时间复杂度为$\mathrm{\Theta }（d\mathrm{日志}（ñ/d））$。概括地说，我们可以定义一个反馈间隔 $[X，ÿ]$， 在哪里 $0\le X\le ÿ\le d$，这样，仅当该数目在该间隔内时，信道才返回发射站的确切数目。对于居中的反馈间隔$d/2$ 我们证明即使间隔只有一个大小，也可以通过多重反馈获得相同的最佳时间复杂度 $Ø（\sqrt{d\mathrm{日志}d}）$。另一方面，如果我们进一步将尺寸减小到$Ø（\frac{\sqrt{d}}{\mathrm{日志}d}）$，那么我们证明没有协议具有时间复杂性 $\mathrm{\Theta }（（d\mathrm{日志}（ñ/d））/（\mathrm{日志}d））$ 是可能的。