Construction of optimal constant-dimension subspace codes

DOI10.1007/S10878-015-9864-ZzbMath1338.94110OpenAlexW1997558960MaRDI QIDQ281823

Wayne Pullan, Xin-Wen Wu, Zi-Hui Liu

Publication date: 11 May 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9864-z

zbMATH Keywords

optimisationmaximum independent setsubspace codesbig graphs

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27) Arithmetic codes (94B40)

Related Items (3)

Cores and independence numbers of Grassmann graphs ⋮ Erdős-Ko-Rado theorem, Grassmann graphs and \(p^s\)-Kneser graphs for vector spaces over a residue class ring ⋮ On the \(P_3\)-hull numbers of \(q\)-Kneser graphs and Grassmann graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Johnson type bounds on constant dimension codes
• Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers
• Coding for Errors and Erasures in Random Network Coding
• Interactive Communication, Diagnosis and Error Control in Networks
• Subspace Codes
• Linear authentication codes: bounds and constructions
• Error-Correcting Codes in Projective Space
• Packing and Covering Properties of Subspace Codes for Error Control in Random Linear Network Coding
• Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance

This page was built for publication: Construction of optimal constant-dimension subspace codes