Abstract
The determination of bounds on the size of codes with given minimum distance is an important problem in the coding theory. In this paper, we construct codes based on partial linear maps of finite-dimensional vector spaces, define the measure of distance via rank function, and present several upper bounds and lower bounds on the size of these codes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data availablility
Enquiries about data availability should be directed to the authors.
References
Ahlswede R, Aydinian H (2009) On error control codes for random network coding. Theory and Applications, In: IEEE workshop on network, pp 68–73
Etzion T, Vardy A (2008) Error-correcting codes in projective space, In: Proceedings of international symposium on information theory, pp 871-875
Gadouleau M, Yan Z (2010) Constant-rank codes and their connection to constant-dimension codes. IEEE Trans Inf Theory 56(7):3207–3216
Gao Y, Wang G (2015) Error-Correcting codes in attenusted space over finite fields. Finite Fields Appl 33:103–117
Guo J, Li FG (2017) Error-Correcting codes based on Totally isotropic Subspaces in Symplectic spaces. Adv Math (Chinese) 46:919–931
Huffman WC, Pless V (2003) Fundamentals of error-corredting codes. Cambridge University Press, Cambridge, United Kingdom
Kötter R, Kschischang R (2008) Coding for errors and erasures in random network coding. IEEE Trans Inf Theory 54(8):3579–3591
Khaleghi A, Sliva D, Kschischang R (2009) Subspace codes, Springer the series. Lecture Notes Comput Sci 5921:1–21
Liu J, Jiang W, Zhang B, Xu Q (2014) Lattices associated with partial linear maps of finite vector spaces. Ars Combinatoria 114:97–103
Wang H, Xing C, Safavi-Naini RM (2003) Linear authentication codes: bounds and constructions. IEEE Trans Inf Theory 49:866–872
Acknowledgements
This research is supported by NSF of Hebei Province (A2018408046), the Fundamental Research Funds for the Universities in Hebei Province (JYT202102).
Funding
Funding was provided by Natural Science Foundation of Hebei Province (Grant Number A2018408046), Fundamental Research Funds for the Universities in Hebei Province (Grant Number JYT202102)
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors have not disclosed any competing interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Liu, J., Jiang, W. & Zhang, X. Error-correcting codes based on partial linear maps of finite-dimensional vector spaces. J Comb Optim 44, 1377–1386 (2022). https://doi.org/10.1007/s10878-022-00895-6
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-022-00895-6