Bounds on the Average Binary Minimum Distance and the Maximum Likelihood Performance of Reed Solomon Codes

机译：Reed Solomon码的平均二进制最小距离和最大似然性能的界

获取原文

获取原文并翻译 | 示例

页面导航

摘要
著录项
相似文献
相关主题

摘要

In this paper, an average binary weight enumerator of Reed Solomon (RS) codes is derived assuming a binomial distribution of the bits in a non-zero symbol. Lower bounds on the average binary minimum distance are shown. The averaged binary image of the RS code is shown to be asymptotically good for sufficiently high rates. These results are used to bound the maximum likelihood performance of RS codes, whose binary image is modulated using binary phase shift keying on AWGN channels, for both hard and soft decision decoding.

机译：在本文中，假设非零符号中位的二项式分布，则得出里德所罗门（RS）码的平均二进制权重枚举数。显示了平均二进制最小距离的下限。对于足够高的速率，RS码的平均二进制图像显示为渐近良好。这些结果用于限制RS码的最大似然性能，RS码的二进制图像使用AWGN通道上的二进制相移键控进行调制，用于硬判决和软判决解码。

著录项

来源
《Annual Allerton Conference on Communication, Control, and Computing; 20040929-1001; Monticello,IL(US)》|2004年|P.290-299|共10页
会议地点 MonticelloIL(US)
作者
Mostafa El-Khamy; Robert J. McEliece;
展开▼
作者单位

California Institute of Technology 1200 E California Blvd. Pasadena, CA 91125;

展开▼
会议组织
原文格式 PDF
正文语种 eng
中图分类通信;
关键词

相似文献

外文文献
中文文献
专利

1. Performance of Adaptive Belief Propagation Decoding and Maximum-Likelihood Bounds for Reed–Solomon Codes on Partial-Response Channels [J] . Todd R.M., Cruz J.R. IEEE Transactions on Magnetics . 2006,第期

机译：部分响应信道上Reed-Solomon码的自适应置信传播解码和最大似然边界的性能
2. An upper bound on the average probability of an undetected error for the ensemble of binary expansions of concatenated codes with generalized Reed-Solomon outer codes [J] . Toshihisa Nishimima 電子情報通信学会技術研究報告. 情報理論. Information Theory . 2001,第304期

机译：具有广义Reed-Solomon外码的级联码二进制展开的整体的未检测到的错误的平均概率的上限
3. An upper bound on the average probability of an undetected error for the ensemble of binary expansions of concatenated codes with generalized Reed-Solomon outer codes [J] . Toshihisa Nishimima 電子情報通信学会技術研究報告. 情報理論. Information Theory . 2001,第304期

机译：具有通用簧片外部代码的级联代码的二进制扩展集合的平均概率上限
4. Bounds on the Average Binary Minimum Distance and the Maximum Likelihood Performance of Reed Solomon Codes [C] . Mostafa El-Khamy, Robert J. McEliece, University of Illinois at Urbana-Champaign, Annual Allerton Conference on Communication, Control, and Computing . 2004

机译：平均二元最小距离和Reed Solomon代码的最大似然性能的界限
5. Upper bounds on the performance of maximum-likelihood decoded binary block codes in AWGN and block fading channels. [D] . Mehrabian, Amaan. 2005

机译：AWGN和块衰落信道中最大似然解码二进制块代码的性能上限。
6. Maximum Likelihood vs. Minimum Distance [O] . Aurora García-Dorado, Araceli Gallego 2004

机译：最大可能性与最小距离
7. Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring [O] . Martínez-Peñas, Umberto 2017

机译：偏斜和线性化Reed-solomon码和最大和秩距离任何分区环上的代码
8. Binary Weight Distributions of Low Rate Reed-Solomon Codes [R] . Retter, C. T. 1995

机译：低速率Reed-solomon码的二进制权重分布

Bounds on the Average Binary Minimum Distance and the Maximum Likelihood Performance of Reed Solomon Codes

摘要

著录项

相似文献

相关主题

期刊订阅