首页> 外文会议>International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes(AAECC-16); 20060220-24; Las Vegas, NV(US) >Algebraic Constructions of Quasi-cyclic LDPC Codes Part Ⅰ: For AWGN and Binary Random Erasure Channels
【24h】

Algebraic Constructions of Quasi-cyclic LDPC Codes Part Ⅰ: For AWGN and Binary Random Erasure Channels

机译:准循环LDPC码的代数构造第一部分:用于AWGN和二进制随机擦除信道

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

摘要

This paper is the first part of a sequence of two papers that present algebraic constructions of quasi-cyclic LDPC codes for AWGN, binary random and burst erasure channels. In this paper, a class of quasi-cyclic LDPC codes for both AWGN and binary random erasure channels is constructed based on finite fields and special vector representations of finite field elements.
机译:本文是两篇论文序列的第一部分,介绍了用于AWGN,二进制随机和突发擦除信道的准循环LDPC码的代数构造。本文基于有限域和有限域元素的特殊矢量表示,构造了一类用于AWGN和二进制随机擦除信道的准循环LDPC码。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号