首页> 外文期刊>IEEE Transactions on Information Theory >Construction and Lattices: Construction, Goodness, and Decoding Algorithms
【24h】

Construction and Lattices: Construction, Goodness, and Decoding Algorithms

机译:构造和格:构造,优度和解码算法

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

摘要

A novel construction of lattices is proposed. This construction can be thought of as a special class of Construction A from codes over finite rings that can be represented as the Cartesian product of linear codes over , respectively, and hence is referred to as Construction . The existence of a sequence of such lattices that is good for channel coding (i.e., Poltyrev-limit achieving) under multistage decoding is shown. A new family of multilevel nested lattice codes based on Construction lattices is proposed and its achievable rate for the additive white Gaussian noise channel is analyzed. A generalization named Construction is also investigated, which subsumes Construction A with codes over prime fields, Construction D, and Construction as special cases.
机译:提出了一种新颖的格子结构。从有限环上的代码可以将这种构造视为构造A的特殊类,有限环上的代码可以分别表示为上线性代码的笛卡尔积,因此被称为构造。示出了这种格的序列的存在,该序列对于多级解码下的信道编码(即,实现Poltyrev极限)是有利的。提出了一个新的基于构造晶格的多层嵌套晶格码族,并分析了其在加性高斯白噪声通道中的可实现率。还研究了一个名为“构造”的概括,该构造将“构造A”包含在主要字段,“构造D”和“构造”上的代码作为特例。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号