Abstract
A direct proof of a polynomial complexity algorithm for a certain class of multiple user detection problems is given. Properties of signature signal matrices leading to the polynomial complexity algorithm are identified.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
