...
首页> 外文期刊>IEEE Transactions on Information Theory >On the Pless-construction and ML decoding of the (48,24,12) quadratic residue code
【24h】

On the Pless-construction and ML decoding of the (48,24,12) quadratic residue code

机译:关于(48,24,12)二次余数码的Pless构造和ML解码

获取原文
获取原文并翻译 | 示例
           

摘要

We present a method for maximum likelihood decoding of the (48,24,12) quadratic residue code. This method is based on projecting the code onto a subcode with an acyclic Tanner graph, and representing the set of coset leaders by a trellis diagram. This results in a two level coset decoding which can be considered a systematic generalization of the Wagner rule. We show that unlike the (24,12,8) Golay code, the (48,24,12) code does not have a Pless-construction which has been an open question in the literature. It is determined that the highest minimum distance of a (48,24) binary code having a Pless (1986) construction is 10, and up to equivalence there are three such codes.
机译:我们提出了一种对(48,24,12)二次残差码进行最大似然解码的方法。此方法基于将代码投影到具有非循环Tanner图的子代码上,并通过网格图表示陪集领导者的集合。这导致两级陪集解码,可以将其视为Wagner规则的系统概括。我们证明,与(24,12,8)Golay代码不同,(48,24,12)代码没有Pless构造,这在文献中是一个未解决的问题。已确定具有Pless(1986)构造的(48,24)二进制代码的最高最小距离为10,直到等价为止,存在三个此类代码。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号