Skip to main content
SpringerLink
Log in

Subspaces intersecting in at most a point

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

We improve on the lower bound of the maximum number of planes in \({\text {PG}}(8,q)\cong \mathbb {F}_q^{9}\) pairwise intersecting in at most a point. In terms of constant dimension codes this leads to \(A_q(9,4;3)\ge q^{12}+ 2q^8+2q^7+q^6+2q^5+2q^4-2q^2-2q+1\). This result is obtained via a more general construction strategy, which also yields other improvements.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Notes

  1. The same applies to \(\mathcal {C}_1\), i.e., we can avoid to use [2, Theorem 3.12], see the subsequent Footnote 3.

  2. Using linearized polynomials to described the lifted MRD code, a clique of matching size can be described as the set of monomials ax (including the zero polynomial).

  3. Both constructions are stated in the language of linearized polynomials. For [9, Lemma 12, Example 4] the representation \(\mathbb {F}_q^6\cong \mathbb {F}_{q^3}\times \mathbb {F}_{q^3}\) is used and the planes removed from the lifted MRD code correspond to \(ux^q-u^qx\) for \(u\in \mathbb {F}_{q^3}\), so that the monomials ax for \(a\in \mathbb {F}_{q^3}\backslash \{\mathbf {0}\}\) correspond to a clique of cardinality \(q^3-1\). For [8, Theorem 4] the representation \(\mathbb {F}_q^7\cong W\times \mathbb {F}_{q^4}\), where W denotes the trace-zero subspace of \(\mathbb {F}_{q^4}/\mathbb {F}_q\), is used. The planes removed from the lifted MRD code correspond to \(r\left( ux^q-u^qx\right) \) for \(r\in \mathbb {F}_{q^4}\backslash \{\mathbf {0}\}\) and \(u\in \mathbb {F}_{q^4}\) with \({\text {tr}}(u)=1\), so that the monomial s ax for \(a\in \mathbb {F}_{q^4}\) correspond to a clique of cardinality \(q^4\).

References

  1. Ai J., Honold T., Liu H.: The expurgation-augmentation method for constructing good plane subspace codes. arXiv:1601.01502 (2016).

  2. Cossidente A., Marino G., Pavese F.: Subspace code constructions. arXiv:1905.11021 (2019).

  3. Cossidente A., Pavese F.: On subspace codes. Des. Codes Cryptogr. 78(2), 527–531 (2016).

    Article  MathSciNet  Google Scholar 

  4. Delsarte P.: Bilinear forms over a finite field, with applications to coding theory. J. Comb. Theory Ser. A 25(3), 226–241 (1978).

    Article  MathSciNet  Google Scholar 

  5. Etzion T., Silberstein N.: Codes and designs related to lifted MRD codes. IEEE Trans. Inform. Theory 59(2), 1004–1017 (2013).

    Article  MathSciNet  Google Scholar 

  6. Heinlein D., Honold T., Kiermaier M., Kurz S., Wassermann A.: Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6. Des. Codes Cryptogr. 87(2–3), 375–391 (2019).

    Article  MathSciNet  Google Scholar 

  7. Heinlein D., Kiermaier M., Kurz S., Wassermann A.: Tables of subspace codes. arXiv:1601.02864 (2016).

  8. Honold T., Kiermaier M.: On putative \(q\)-analogues of the Fano plane and related combinatorial structures. In Dynamical Systems, Number Theory and Applications, pp. 141–175. World Sci. Publ., Hackensack, NJ (2016).

    Chapter  Google Scholar 

  9. Honold T., Kiermaier M., Kurz S.: Optimal binary subspace codes of length \(6\), constant dimension \(3\) and minimum subspace distance \(4\). In Topics in Finite Fields, Volume 632 of Contemp. Math., pp. 157–176. Amer. Math. Soc., Providence, RI (2015).

  10. Honold T., Kiermaier M., Kurz S.: Partial spreads and vector space partitions. In Network Coding and Subspace Designs, Signals and Communication Technology, pp. 131–170. Springer, Cham (2018).

    Chapter  Google Scholar 

  11. Kötter R., Kschischang F.R.: Coding for errors and erasures in random network coding. IEEE Trans. Inform. Theory 54(8), 3579–3591 (2008).

    Article  MathSciNet  Google Scholar 

  12. Kurz S.: A note on the linkage construction for constant dimension codes. arXiv:1906.09780 (2019).

  13. Silva D., Kschischang F., Kötter R.: A rank-metric approach to error control in random network coding. IEEE Trans. Inform. Theory 54(9), 3951–3967 (2008).

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The author would like to thank Thomas Honold for his analysis of possible clique sizes in the constant dimension codes from [9, Lemma 12, Example 4] and [8, Theorem 4], see Footnote 3. The main idea for Theorem 3 is inspired by [2]. Further thanks go to the anonymous referees for their careful reading and helpful remarks.

Author information

Authors and Affiliations

  1. University of Bayreuth, 95440, Bayreuth, Germany

    Sascha Kurz

Authors
  1. Sascha Kurz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sascha Kurz.

Additional information

Communicated by G. Lunardon.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kurz, S. Subspaces intersecting in at most a point. Des. Codes Cryptogr. 88, 595–599 (2020). https://doi.org/10.1007/s10623-019-00699-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-019-00699-6

Keywords

Mathematics Subject Classification

Search

Navigation