Name
Abstract | ||
|---|---|---|
In this letter, we introduce a novel method for constructing large size Generalized Welch Bound Equality (GWBE) matrices. This method can also be used for the construction of large WBE matrices. The advantage of this method is its low complexity for constructing large size matrices and low computational complexity using Maximum Likelihood (ML) decoders for a subclass of these codes. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/LCOMM.2010.01.091900 | IEEE Communications Letters |
Keywords | Field | DocType |
novel method,maximum likelihood,decoding gwbe code,low complexity,generalized welch bound equality,low computational complexity,kronecker product,large size matrix,large size,large wbe matrix,computational modeling,gaussian distribution,java,channel capacity,correlation,binary codes,computational complexity,data mining,bit error rate,decoding,codes | Discrete mathematics,Kronecker delta,Kronecker product,Computer science,Matrix (mathematics),Matrix algebra,Maximum likelihood,Decoding methods,Computational complexity theory,Bit error rate | Journal |
Volume | Issue | ISSN |
14 | 1 | 1089-7798 |
Citations | PageRank | References |
12 | 0.60 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| pedram pad | 1 | 134 | 12.41 |
| Mohammad Javad Faraji | 2 | 57 | 3.69 |
| Farokh Marvasti | 3 | 573 | 72.71 |