Name
Abstract | ||
|---|---|---|
In this study, the authors consider the designing of a new set of uniquely decodable codes for uncoded synchronous overloaded code division multiple access for the number of codes exceeding the assigned code length. For the construction, the proposed recursive method at iteration-k generates a matrix that can be classified into k orthogonal subsets of different dimensions. Out of them, all besides... |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1049/iet-com.2015.0819 | IET Communications |
Keywords | Field | DocType |
code division multiple access,codes,correlation methods,error statistics,filtering theory,iterative methods,matched filters,matrix algebra,maximum likelihood decoding,radiofrequency interference,set theory | Locally decodable code,Synchronous CDMA,Algorithm,Communication channel,Computer network,Cardinality,Theoretical computer science,Code division multiple access,Hadamard transform,Mathematics,Bit error rate,Binary number | Journal |
Volume | Issue | ISSN |
10 | 10 | 1751-8628 |
Citations | PageRank | References |
2 | 0.39 | 27 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Amiya Singh | 1 | 2 | 0.73 |
| Arash Amini | 2 | 178 | 22.46 |
| Poonam Singh | 3 | 32 | 7.23 |
| Farokh Marvasti | 4 | 573 | 72.71 |