Polynomial time algorithms for network information flow
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Spectral approach to linear programming bounds on codes
Problems of Information Transmission
The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction]
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
An information-theoretic view of network management
IEEE Transactions on Information Theory
Rank subcodes in multicomponent network coding
Problems of Information Transmission
| Hi-index | 0.00 |
The subspace metric is an object of active research in network coding. Nevertheless, little is known on codes over this metric. In the present paper, several classes of codes over subspace metric are defined and investigated, including codes with distance 2, codes with the maximal distance, and constant-distance constant-dimension codes. Also, Gilbert-type bounds are presented.