2019/10/10 by Xianmang He, He, Xianmang
Computer Science · Engineering · #68P30 #Coding theory and cryptography #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1910.04472
openalex publication_date 2019/10/10 · openalex created_date 2019/10/18 · openalex updated_date 2026/07/28
The linkage construction and its generalization is one of the most powerful constructions for constant dimension code, accounting for approximately 50% of all the listed parameters. We show how to improve the linkage construction of subspace codes by two parallel versions of the linkage construction. This proof allows us to attain codes of larger size for a given minimum distance, which exceeds the latest improvements on the linkage construction \citecombining2019Antonio in the cases Aq(13,4,4),Aq(17,4,4), Aq(19,6,6).