|
Problemy Peredachi Informatsii, 2013, Volume 49, Issue 1, Pages 46–60
(Mi ppi2101)
|
|
|
|
This article is cited in 13 scientific papers (total in 13 papers)
Coding Theory
Rank subcodes in multicomponent network coding
E. M. Gabidulin, N. I. Pilipchuk Moscow Institute of Physics and Technology (State University)
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.
Received: 13.08.2012 Revised: 03.12.2012
Citation:
E. M. Gabidulin, N. I. Pilipchuk, “Rank subcodes in multicomponent network coding”, Probl. Peredachi Inf., 49:1 (2013), 46–60; Problems Inform. Transmission, 49:1 (2013), 40–53
Linking options:
https://www.mathnet.ru/eng/ppi2101 https://www.mathnet.ru/eng/ppi/v49/i1/p46
|
Statistics & downloads: |
Abstract page: | 298 | Full-text PDF : | 85 | References: | 35 | First page: | 19 |
|