Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space

DOI10.1155/2014/497958zbMath1463.94069OpenAlexW2023454646WikidataQ59051745 ScholiaQ59051745MaRDI QIDQ2336478

You Gao, Gang Wang

Publication date: 19 November 2019

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/497958

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Other types of codes (94B60) Authentication, digital signatures and secret sharing (94A62) Communication theory (94A05)

Related Items (4)

Subspace code based on flats in affine space over finite fields ⋮ Bounds on subspace codes based on subspaces of type \((s,0,0,0)\) in pseudo-symplectic spaces and singular pseudo-symplectic spaces ⋮ Bounds on subspace codes based on totally isotropic subspace in symplectic spaces and extended symplectic spaces ⋮ Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2

Cites Work

• Unnamed Item
• Singular linear space and its applications
• Johnson type bounds on constant dimension codes
• Codes and anticodes in the Grassman graph
• A Random Linear Network Coding Approach to Multicast
• Coding for Errors and Erasures in Random Network Coding
• A Rank-Metric Approach to Error Control in Random Network Coding
• Network information flow
• 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 subspaces of type \((m, 1)\) in singular linear space