A Fast Matrix Decoding Algorithm for Rank-Error-Correcting Codes
Proceedings of the First French-Soviet Workshop on Algebraic Coding
Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams
IEEE Transactions on Information Theory
Construction and covering properties of constant-dimension codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Algebraic codes for network coding
Problems of Information Transmission
Ideals over a non-commutative ring and their application in cryptology
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Recursive code construction for random networks
IEEE Transactions on Information Theory
Decoding of random network codes
Problems of Information Transmission
A welch–berlekamp like algorithm for decoding gabidulin codes
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
IEEE Transactions on Information Theory
Linear authentication codes: bounds and constructions
IEEE Transactions on Information Theory
Coding for Errors and Erasures in Random Network Coding
IEEE Transactions on Information Theory
A Rank-Metric Approach to Error Control in Random Network Coding
IEEE Transactions on Information Theory
Linearized Shift-Register Synthesis
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
A new class of subcodes in rank metric is proposed; based on it, multicomponent network codes are constructed. Basic properties of subspace subcodes are considered for the family of rank codes with maximum rank distance (MRD codes). It is shown that nonuniformly restricted rank subcodes reach the Singleton bound in a number of cases. For the construction of multicomponent codes, balanced incomplete block designs and matrices in row-reduced echelon form are used. A decoding algorithm for these network codes is proposed. Examples of codes with seven and thirteen components are given.