Constructing and decoding GWBE codes using Kronecker products
IEEE Communications Letters（2010）
摘要
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.
更多查看译文
关键词
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
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要