On the Capacity of Multiplicative Finite-Field Matrix Channels

This paper deals with the multiplicative finite-field matrix channel, a discrete memoryless channel whose input and output are matrices (over a finite field) related by a multiplicative transfer matrix. The model considered here assumes that all transfer matrices with the same rank are equiprobable,...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 59; no. 8; pp. 4949 - 4960
Main Authors:	Nobrega, Roberto W., Silva, Danilo, Uchoa-Filho, Bartolomeu F.
Format:	Journal Article
Language:	English
Published:	New York, NY IEEE 01.08.2013 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Applied sciences Channel capacity Coding, codes Communication channels Exact sciences and technology finite-field matrix channel Information theory Information, signal and communications theory Matrix multiplicative matrix channel Network coding Network topology noncoherent network coding Optimization Probability distribution random linear network coding Receivers Signal and communications theory subspace coding Switching and signalling Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Transmission and modulation (techniques and equipments) Transmitters Upper bound Lower bound Finite field Transfer matrix Lossless circuit Packet switching random linear network coding Channel capacity Discrete channel Subspace method finite-field matrix channel Random coding Convex programming Networked system subspace coding Memoryless channel Linear coding Linear system Network coding multiplicative matrix channel noncoherent network coding
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!