Construction of constant dimension codes via improved inserting construction
From MaRDI portal
Publication:6056622
DOI10.1007/s00200-021-00537-0OpenAlexW3217377561MaRDI QIDQ6056622
Daitao Huang, Yongfeng Niu, Qin Yue
Publication date: 30 October 2023
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-021-00537-0
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Related Items (1)
Cites Work
- Construction of subspace codes through linkage
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
- New constant dimension subspace codes from block inserting constructions
- New constant dimension subspace codes from parallel linkage construction and multilevel construction
- Several kinds of large cyclic subspace codes via Sidon spaces
- New constructions of large cyclic subspace codes and Sidon spaces
- Codes and Designs Related to Lifted MRD Codes
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Coset Construction for Subspace Codes
- New Constant-Dimension Subspace Codes from Maximum Rank Distance Codes
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- Construction of Constant Dimension Subspace Codes by Modifying Linkage Construction
- New Constructions of Subspace Codes Using Subsets of MRD Codes in Several Blocks
- Parallel Multilevel Constructions for Constant Dimension Codes
- Maximal Ferrers Diagram Codes: Constructions and Genericity Considerations
- Combining subspace codes
This page was built for publication: Construction of constant dimension codes via improved inserting construction
