Algebraic constructions of graph-based nested codes from protographs
Algebraic constructions of graph-based nested codes from protographs
复制标题
来自原型图的基于图的嵌套代码的代数构造
DOI：
--
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
J. Kliewer
中科院分区：
文献类型：
--
作者：
C. Kelley;J. Kliewer
作为叠加码的特定情况，嵌套码已经在大量通信应用中被采用，例如在存在噪声的情况下、在联合网络信道编码中或在物理层保密中实现分箱方案。鉴于最近已经提出了连续输入信道的嵌套格码，在本文中，我们专注于构造嵌套线性码的联合信道网络编码问题的基础上代数原模图LDPC码。特别是，在过去的几年中，已经提出了几个建设的代码是基于随机升降机适当选择的基本图形。最近，这种方法的代数模拟引入了电压图理论。在本文中，我们说明了如何使用这些方法可以在建设嵌套代码的代数升降机的图。
Nested codes have been employed in a large number of communication applications as a specific case of superposition codes, for example to implement binning schemes in the presence of noise, in joint network-channel coding, or in physical-layer secrecy. Whereas nested lattice codes have been proposed recently for continuous-input channels, in this paper we focus on the construction of nested linear codes for joint channel-network coding problems based on algebraic protograph LDPC codes. In particular, over the past few years several constructions of codes have been proposed that are based on random lifts of suitably chosen base graphs. More recently, an algebraic analog of this approach was introduced using the theory of voltage graphs. In this paper we illustrate how these methods can be used in the construction of nested codes from algebraic lifts of graphs.