Rank subcodes in multicomponent network coding
EM Gabidulin, NI Pilipchuk - Problems of information transmission, 2013 - Springer
EM Gabidulin, NI Pilipchuk
Problems of information transmission, 2013•SpringerA 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 …
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 …
Abstract
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.
Springer
Showing the best result for this search. See all results