Abstract
A subspace code of length \(n\) over the finite field \(\mathbb {F}_q\) is a collection of subspaces of the \(n\)-dimensional vector space \(\mathbb {F}_q^n\). Subspace codes are applied to a number of areas such as noncoherent linear network coding and linear authentication. A challenge in the research of subspace codes is to construct large codes with prescribed code parameters, such that the codes have the maximum number of codewords, or the number of codewords is larger than that of previously known codes. In the literature, a general method was proposed for the construction of large constant-dimension subspace codes based on integer linear programming. In this work, making use of an optimization approach for finding the maximum independent set of a graph, a procedure is developed for constructing large subspace codes. The procedure, in some cases, outperforms the existing approach based on integer linear programming, and finds new subspace codes that have more codewords than existing codes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahlswede R, Aydinian H (2009) On error control for random network coding. In: IEEE Workshop on Network Coding, Theory and Applications 2009
Etzion T, Vardy A (2008) Error-correcting codes in projective space. In: Proceedings of IEEE International Symposium Information Theory, Toronto, pp. 871–875, 2008
Gadouleau M, Yan Z (2010) Packing and covering properties of subspace codes for error control in random linear network coding. IEEE Trans Inf Theory 56(5):2097–2108
Garey M, Johnson D (1979) Computers and intractability: a guide to the theory of \({\cal NP}\)-completeness. Freeman, San Fancisco, CA
Khaleghi A, Silva D, Kschischang F (2009) Subspace codes. In: Parker M (ed) Cryptography and coding, LNCS, Springer, Berlin, pp 1–21
Kohnert A, Kurz S (2008) Construction of large constant dimension codes with a prescribed minimum distance. In: Calmet J, Geiselmann W, Müller-Quade J (eds) BethFestschrift, LNCS 5393, Springer, Berlin, Heidelberg, pp. 31–42
Kötter R, Kschischang F (2008) Coding for errors and erasures in random network coding. IEEE Trans Inf Theory 54(8):3579–3591
Pullan W (2009) Optimization of unweighted/weighted maximum independent sets and minimum vertex covers. Dis Optim 6(2):214–219
Silberstein N (2008) Coding theory in projective space. Ph.D. Thesis, 2008
Wan Z (1993) Geometry of classical groups over finite fields. Studentlitteratur/Chartwell Bratt, Lund
Wang H, Xing C, Safavi-Naini R (2003) Linear authentication codes: bounds and constructions. IEEE Trans Inf Theory 49(4):866–872
Xia S, Fu F (2009) Johnson type bounds on constant dimension codes. Des Codes Cryptogr 50(2):163–172
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Pullan, W., Wu, XW. & Liu, Z. Construction of optimal constant-dimension subspace codes. J Comb Optim 31, 1709–1719 (2016). https://doi.org/10.1007/s10878-015-9864-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-015-9864-z