摘要
The application of sequential decoding to codes of practically short code length was considered. Empirical investigations showed that by a proper choice of the weighting factor, the generalized Fano metric in sequential decoding can yield a markedly smaller bit-error rate and the computational complexity would moderately increase.
原文 | English |
---|---|
文章編號 | 1023557 |
頁(從 - 到) | 285-285 |
頁數 | 1 |
期刊 | IEEE International Symposium on Information Theory-Proceedings |
DOIs | |
出版狀態 | Published - 30 6月 2002 |