Communication Over Finite-Chain-Ring Matrix Channels

DOI10.1109/TIT.2014.2346079MaRDI QIDQ2983387zbMATH OpenOpenAlexWikidataFDO

Authors Chen Feng, Roberto W. Nóbrega, Frank R. Kschischang, Danilo Silva

Publication date 16 May 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1304.2523

Mathematics Subject Classification ID

Communication theory (94A05) Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40)

Abstract: Though network coding is traditionally performed over finite fields, recent work on nested-lattice-based network coding suggests that, by allowing network coding over certain finite rings, more efficient physical-layer network coding schemes can be constructed. This paper considers the problem of communication over a finite-ring matrix channel $Y=AX+BE$, where $X$ is the channel input, $Y$ is the channel output, $E$ is random error, and $A$ and $B$ are random transfer matrices. Tight capacity results are obtained and simple polynomial-complexity capacity-achieving coding schemes are provided under the assumption that $A$ is uniform over all full-rank matrices and $BE$ is uniform over all rank-$t$ matrices, extending the work of Silva, Kschischang and K"{o}tter (2010), who handled the case of finite fields. This extension is based on several new results, which may be of independent interest, that generalize concepts and methods from matrices over finite fields to matrices over finite chain rings.

Cited in

(12)

• Density of free modules over finite chain rings
• Low-rank parity-check codes over Galois rings
• Galois correspondence on linear codes over finite chain rings
• Finite nonassociative algebras obtained from skew polynomials and possible applications to \((f,\sigma,\delta)\)-codes
• Cryptanalysis of the CLR-cryptosystem
• Multilevel lattices for compute-and-forward and lattice network coding
• scientific article; zbMATH DE number 7203492 (Why is no real title available?)
• The Smith normal form distribution of a random integer matrix
• Convolutional codes over finite chain rings, MDP codes and their characterization
• Sperner's theorem for non-free modules over finite chain rings
• On the generalizations of the rank metric over finite chain rings
• Self-dual matrix codes over Galois rings

This page was built for publication: Communication Over Finite-Chain-Ring Matrix Channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2983387)