素域上$\mathcal{GRM}(2,m)^*$的ODPC在增加消息长度时的界和可解性
On the bounds and achievability about the ODPC of $\mathcal{GRM}(2,m)^*$ over prime field for increasing message length
摘要:
研究了线性分组码的最佳距离分布,以增加或减少消息长度,同时保持最小距离尽可能大,特别是Golay码和二阶Reed-Muller码等。循环码具有更有效的编码和译码算法。本文研究了应用于同步信道中OFDM调制功率控制的删余广义二阶Reed-Muller码$\mathcal{GRM}(2,m)^*$关于循环子码链的最佳距离分布等问题,并按字典逆序考虑了两种标准:用于增加消息长度。给出了ODPC的四个下界和上界,其中下界在一定意义下几乎达到相应的上界。本文讨论的是非二元素域。
英文摘要:
The optimum distance profiles of linear block codes were studied for increasing or decreasing message length while keeping the minimum distances as large as possible, especially for Golay codes and the second-order Reed-Muller codes, etc. Cyclic codes have more efficient encoding and decoding algorithms. In this paper, we investigate the optimum distance profiles with respect to the cyclic subcode chains (ODPCs) of the punctured generalized second-order Reed-Muller codes $\mathcal{GRM}(2,m)^*$ which were applied in Power Control in OFDM Modulations in channels with synchronization, and so on. For this, two standards are considered in the inverse dictionary order, i.e., for increasing message length. Four lower bounds and upper bounds on ODPC are presented, where the lower bounds almost achieve the corresponding upper bounds in some sense. The discussions are over nonbinary prime field.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。