Fuchsian codes with arbitrarily high code rates

From MaRDI portal
Publication:886965

DOI10.1016/J.JPAA.2015.06.005zbMATH Open1378.94081arXiv1410.6094OpenAlexW1851387057MaRDI QIDQ886965FDOQ886965


Authors: Iván Blanco-Chacón, Camilla Hollanti, M. Alsina, Dionís Remón Edit this on Wikidata


Publication date: 27 October 2015

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Abstract: Recently, so-called Fuchsian codes have been proposed in [I. Blanco-Chac'on et al., "Nonuniform Fuchsian codes for noisy channels", J. of the Franklin Institute 2014] for communication over channels subject to additive white Gaussian noise (AWGN). The two main advantages of Fuchsian codes are their ability to compress information, i.e., high code rate, and their logarithmic decoding complexity. In this paper, we improve the first property further by constructing Fuchsian codes with arbitrarily high code rates while maintaining logarithmic decoding complexity. Namely, in the case of Fuchsian groups derived from quaternion algebras over totally real fields we obtain a code rate that is proportional to the degree of the base field. In particular, we consider arithmetic Fuchsian groups of signature (1;e) to construct explicit codes having code rate six, meaning that we can transmit six independent integers during one channel use.


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




Recommendations



Cites Work


Cited In (6)





This page was built for publication: Fuchsian codes with arbitrarily high code rates

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