Communication Over Finite-Chain-Ring Matrix Channels

DOI10.1109/TIT.2014.2346079zbMath1360.94015arXiv1304.2523OpenAlexW3103017684WikidataQ59767629 ScholiaQ59767629MaRDI QIDQ2983387

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

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

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

Related Items (9)

Density of free modules over finite chain rings ⋮ Multilevel lattices for compute-and-forward and lattice network coding ⋮ Finite nonassociative algebras obtained from skew polynomials and possible applications to \((f,\sigma,\delta)\)-codes ⋮ Cryptanalysis of the CLR-cryptosystem ⋮ Convolutional codes over finite chain rings, MDP codes and their characterization ⋮ The Smith Normal Form Distribution of A Random Integer Matrix ⋮ Low-rank parity-check codes over Galois rings ⋮ Galois correspondence on linear codes over finite chain rings ⋮ Unnamed Item

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