A note on optimal constant dimension codes

DOI10.1142/S0129054115500070zbMATH Open1350.94069OpenAlexW2075848522MaRDI QIDQ5250281FDOQ5250281

Authors: Qunying Liao, Juan Zhu 

Publication date: 19 May 2015

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

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

Recommendations

• The interplay of different metrics for the construction of constant dimension codes
• Construction of constant dimension codes in some cases
• Construction of constant dimension codes in some cases
• Constructions for $q$-Ary Constant-Weight Codes
• scientific article; zbMATH DE number 6902639

zbMATH Keywords

lower boundupper boundconstant dimension codedimension distance

Mathematics Subject Classification ID

Other types of codes (94B60)

Cites Work

• Johnson type bounds on constant dimension codes
• A Random Linear Network Coding Approach to Multicast
• Linear authentication codes: bounds and constructions
• Error-Correcting Codes in Projective Space
• Partitions of a vector space
• Perfect byte-correcting codes

Cited In (4)

• Constant-Rank Codes and Their Connection to Constant-Dimension Codes
• A note on constabelian codes
• Johnson type bounds on constant dimension codes
• Construction of constant dimension codes in some cases

This page was built for publication: A note on optimal constant dimension codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5250281)