Abstract
The main problem of constant-dimension subspace coding is to construct constant-dimension codes (CDCs) with the maximum possible cardinality. Lifting Ferrers diagram codes is an effective way to construct CDCs. In addition, the discovery of linkage construction allows to construct many CDCs, i.e., lower bounds. In this paper, we combine the two methods of construction and obtain some new lower bounds of CDCs for small parameters.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
