...
首页> 外文期刊>IEEE Transactions on Information Theory >Convolutional and Tail-Biting Quantum Error-Correcting Codes
【24h】

Convolutional and Tail-Biting Quantum Error-Correcting Codes

机译:卷积和咬尾量子纠错码

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

获取外文期刊封面封底 >>

       

摘要

Rate-(n-2) unrestricted and CSS-type quantum convolutional codes with up to 4096 states and minimum distances up to 10 are constructed as stabilizer codes from classical self-orthogonal rate-1 F4-linear and binary linear convolutional codes, respectively. These codes generally have higher rate and less decoding complexity than comparable quantum block codes or previous quantum convolutional codes. Rate-(n-2) block stabilizer codes with the same rate and error-correction capability and essentially the same decoding complexity are derived from these convolutional codes via tail-biting
机译:根据经典的自正交率-1 / n F4-线性和二进制线性卷积,构造速率为(n-2)/ n的无限制和最多可达4096个状态且最小距离为10的CSS型量子卷积码代码。这些代码通常比类似的量子块代码或先前的量子卷积代码具有更高的速率和更少的解码复杂性。从这些卷积码中通过尾位推导得出具有相同速率和纠错能力以及基本相同的解码复杂度的速率(n-2)/ n块稳定器代码

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号