Abstract
We construct linear codes from projective systems of a finite projective space, arising by considering the points of the lines connecting point-sets chosen and fixed in two complementary subspaces. This construction allows to look for linear codes by choosing appropriate sets to get immediately length and minimum distance.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Huffman W.C.: Codes and groups. In: Pless V.S., Huffman W.C. (eds.) Handbook of Coding Theory, pp. 1345–1440. Elsevier, Amsterdam (1998).
Kroll H.-J., Vincenti R.: PD-sets for the codes related to some classical varieties. Discret. Math. 301, 89–105 (2005).
Kroll H.-J., Vincenti R.: PD-sets for binary RM-codes and the codes related to the Klein quadric and to the Schubert variety of PG(5, 2). Discret. Math. 308, 408–414 (2008).
Napolitano V.: Note on a class of subsets of AG \((3, q)\) with intersection numbers \(1, q\) and \(n\) with respect to the planes. Geometry 2013(589362), 3 (2013).
Tallini G.: Some new results on sets of type \((m, n)\) in projective planes. J. Geom. 29, 191–199 (1987).
Tsfasman M.A., Vlâdut S.G.: Algebraic Geometric Codes. Kluwer, Amsterdam (1991).
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by J. W. P. Hirschfeld.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Kroll, HJ., Vincenti, R. Linear codes from ruled sets in finite projective spaces. Des. Codes Cryptogr. 88, 747–754 (2020). https://doi.org/10.1007/s10623-019-00707-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-019-00707-9