Saved in:
Bibliographic Details
Main Authors: Luo, Chengpin, Kurkoski, Brian M.
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2402.18094
Tags: Add Tag
No Tags, Be the first to tag this record!
Table of Contents:
  • A coding lattice $Λ_c$ and a shaping lattice $Λ_s$ forms a nested lattice code $\mathcal{C}$ if $Λ_s \subseteq Λ_c$. Under some conditions, $\mathcal{C}$ is a finite cyclic group formed by rectangular encoding. This paper presents the conditions for the existence of such $\mathcal{C}$ and provides some designs. These designs correspond to solutions to linear Diophantine equations so that a cyclic lattice code $\mathcal C$ of arbitrary codebook size $M$ can possess group isomorphism, which is an essential property for a nested lattice code to be applied in physical layer network relaying techniques such as compute and forward.