Treffer: Larger Size Subspace Codes with Low Communication Overhead.

Köetter and Kschischang proposed a coding algorithm for network error correction based on subspace codes, which, however, has a high communication overhead (100%). This paper improves upon their coding algorithm and presents a coding algorithm for network error correction with lower communication overhead, which is similar to the communication overhead of classical random network coding. In particular, we utilize the inherent symmetry in subspace codes to optimize the construction process, leading to a more efficient algorithm. At the same time, this paper also studies the construction problem of constant dimension subspace codes, utilizing parallel construction and multilevel construction. By exploiting the symmetry in these methods, we generalize previous results and derive new lower bounds for constant dimension subspace codes. [ABSTRACT FROM AUTHOR]

Copyright of Symmetry (20738994) is the property of MDPI and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)