Rank subcodes in multicomponent network coding

DOI10.1134/S0032946013010043zbMath1322.94103MaRDI QIDQ361696

Ernst M. Gabidulin, Nina I. Pilipchuk

Publication date: 19 August 2013

Published in: Problems of Information Transmission (Search for Journal in Brave)

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Related Items (3)

Construction of subspace codes through linkage ⋮ Message encoding and retrieval for spread and cyclic orbit codes ⋮ System adjustment of data of various nature in multidisciplinary research

Cites Work

• Unnamed Item
• Unnamed Item
• Decoding of random network codes
• Theory of codes with maximum rank distance
• Algebraic codes for network coding
• Large constant dimension codes and lexicodes
• Codes and Designs Related to Lifted MRD Codes
• Maximum rank distance codes as space~time codes
• Coding for Errors and Erasures in Random Network Coding
• A Rank-Metric Approach to Error Control in Random Network Coding
• Space-time codes for high data rate wireless communication: performance criterion and code construction
• Linear authentication codes: bounds and constructions
• Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
• Recursive Code Construction for Random Networks
• Linearized Shift-Register Synthesis
• Coding and Cryptography

This page was built for publication: Rank subcodes in multicomponent network coding