Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2

DOI10.1142/S0129054119500199zbMath1427.94112OpenAlexW2967378597MaRDI QIDQ5205027

Min-Yao Niu, Gang Wang, Fang-Wei Fu

Publication date: 10 December 2019

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054119500199

zbMATH Keywords

finite fieldboundorthogonal spacesubspace codesSteiner structure

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Construction of subspace codes through linkage
• Johnson type bounds on constant dimension codes
• Codes and anticodes in the Grassman graph
• Bounds for projective codes from semidefinite programming
• Error-correcting codes in attenuated space over finite fields
• Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space
• A Random Linear Network Coding Approach to Multicast
• Coding for Errors and Erasures in Random Network Coding
• The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction]
• Network information flow
• Coset Construction for Subspace Codes
• Linear authentication codes: bounds and constructions
• Perfect byte-correcting codes
• Error-Correcting Codes in Projective Space
• Packing and Covering Properties of Subspace Codes for Error Control in Random Linear Network Coding

This page was built for publication: Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2