Bounds on the cardinality of subspace codes with non-maximum code distance

DOI10.1134/S0032946021030030zbMath1496.94081OpenAlexW3204180408MaRDI QIDQ2068654

O. V. Trushina, Ernst M. Gabidulin, Nina I. Pilipchuk

Publication date: 20 January 2022

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

Full work available at URL: https://doi.org/10.1134/s0032946021030030

zbMATH Keywords

subspacespreadsfinite fielddecodingcodespacerank metriccode cardinality

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Decoding (94B35)

Cites Work

• Decoding of random network codes
• Johnson type bounds on constant dimension codes
• Theory of codes with maximum rank distance
• Multicomponent codes with maximum code distance
• EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
• Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
• Coding for Errors and Erasures in Random Network Coding
• A Rank-Metric Approach to Error Control in Random Network Coding
• Network information flow
• New Constant-Dimension Subspace Codes from Maximum Rank Distance Codes