Timeline for How to optimally distinguish between linearly independent vectors in higher dimensional complex/real space?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 23, 2018 at 0:44 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Apr 23, 2018 at 0:03 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Mar 24, 2018 at 0:01 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Feb 21, 2018 at 23:09 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jan 22, 2018 at 23:08 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Dec 23, 2017 at 23:00 | answer | added | H. H. Rugh | timeline score: 1 | |
| Dec 23, 2017 at 19:53 | comment | added | Siddhant Singh | By distinguishing I mean applying the operators to these 4 vectors gives me one of them uniquely and makes the other vanish or at least gives a linear combination of the 4 with very high probability of one and vanishingly of the other ones (this is optimization distinguishability) when they are not orthogonal. | |
| Dec 23, 2017 at 19:31 | comment | added | David Handelman | Please make precise what you mean by distinguish; it would also be helpful if you gave an example. | |
| Dec 23, 2017 at 17:15 | review | First posts | |||
| Dec 23, 2017 at 17:35 | |||||
| Dec 23, 2017 at 17:13 | history | asked | Siddhant Singh | CC BY-SA 3.0 |