The capacity of a finite field matrix channel

arXiv2210.14100MaRDI QIDQ6415083FDOQ6415083

Authors: Simon R. Blackburn, Jessica Claridge 

Publication date: 25 October 2022

Abstract: The Additive-Multiplicative Matrix Channel (AMMC) was introduced by Silva, Kschischang and K"otter in 2010 to model data transmission using random linear network coding. The input and output of the channel are $nimesm$ matrices over a finite field $mathbb{F}_q$. On input the matrix $X$, the channel outputs $Y=A(X+W)$ where $A$ is a uniformly chosen $nimesn$ invertible matrix over $mathbb{F}_q$ and where $W$ is a uniformly chosen $nimesm$ matrix over $mathbb{F}_q$ of rank $t$. Silva emph{et al} considered the case when $2nleqm$. They determined the asymptotic capacity of the AMMC when $t$, $n$ and $m$ are fixed and $qightarrowinfty$. They also determined the leading term of the capacity when $q$ is fixed, and $t$, $n$ and $m$ grow linearly. We generalise these results, showing that the condition $2ngeqm$ can be removed. (Our formula for the capacity falls into two cases, one of which generalises the $2ngeqm$ case.) We also improve the error term in the case when $q$ is fixed.

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

This page was built for publication: The capacity of a finite field matrix channel

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