Enhancing Echelon-Ferrers construction for constant dimension code

DOI10.1007/s12190-021-01680-0OpenAlexW4206715203MaRDI QIDQ2103101

Xianmang He, Zusheng Zhang, Jianguang Dun, Yindong Chen

Publication date: 13 December 2022

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

Full work available at URL: https://doi.org/10.1007/s12190-021-01680-0

zbMATH Keywords

projective spaceconstant dimension codeslinkage constructionEchelon-Ferrersreduced echelon form

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (1)

Generalized block inserting for constructing new constant dimension codes

Cites Work

• Construction of subspace codes through linkage
• Bilinear forms over a finite field, with applications to coding theory
• Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
• Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
• Optimal Ferrers Diagram Rank-Metric Codes
• Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks
• Coding for Errors and Erasures in Random Network Coding
• Subspace Codes
• Coset Construction for Subspace Codes
• New Constant-Dimension Subspace Codes from Maximum Rank Distance Codes
• Generalized Linkage Construction for Constant-Dimension Codes
• Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
• Construction of Constant Dimension Subspace Codes by Modifying Linkage Construction
• Combining subspace codes

This page was built for publication: Enhancing Echelon-Ferrers construction for constant dimension code