Communication Over Finite-Field Matrix Channels

Finite field matrix channels for network coding

In 2010, Silva, Kschischang and Kötter studied certain classes of finite field matrix channels in order to model random linear network coding where exactly t random errors are introduced. In this paper we introduce a generalisation of these matrix channels where the number of errors is not required to be constant. We show that a capacity-achieving input distribution can always be taken to have ...

Wireless Communication over Dispersive Channels

Video communication over broadcast channels

This paper investigates the problem of communicating video over a broadcast channel. The broadcast channel is expressed in terms of the channel capacity that exists between the transmitter and each receiver in the broadcast area { Shannon's separation theorem does not apply for video communication over this class of channels. Digital (discrete time, discrete amplitude) and hybrid (discrete time...

Feedback Communication over Unknown Channels

Suppose Q is a family of discrete memoryless channels. An unknown member of Q will be available, with perfect, causal output feedback for communication. Is there a coding scheme (possibly with variable transmission time) that can achieve the Burnashev error exponent uniformly over Q ? For two families of channels we show that the answer is yes. Furthermore, for each of these two classes, in add...

enumerating algebras over a finite field

‎we obtain the porc formulae for the number of non-associative algebras‎ ‎of dimension 2‎, ‎3 and 4 over the finite field gf$(q)$‎. ‎we also give some‎ ‎asymptotic bounds for the number of algebras of dimension $n$ over gf$(q)$.