Skip to main content
SpringerLink
Log in

Cyclic subspace codes via subspace polynomials

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

Abstract

Subspace codes have been intensely studied in the last decade due to their application in random network coding. In particular, cyclic subspace codes are very useful subspace codes with their efficient encoding and decoding algorithms. In a recent paper, Ben-Sasson et al. gave a systematic construction of subspace codes using subspace polynomials. In this paper, we mainly generalize and improve their result so that we can obtain larger codes for fixed parameters and also we can increase the density of some possible parameters. In addition, we give some relative remarks and explicit examples.

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

References

  1. Ben-Sasson E., Etzion T., Gabizon A., Raviv N.: Subspace polynomials and cyclic subspace codes. IEEE Trans. Inf. Theory 62, 1157–1165 (2016).

    Article  MathSciNet  MATH  Google Scholar 

  2. Braun M., Etzion T., Ostergard P., Vardy A., Wasserman A.: Existence of q-analogues of Steiner systems. arXiv:1304.1462v2 [math.CO].

  3. Drudge K.: On the orbits of Singer groups and their subgroups. Electron. J. Comb. 9(1), 10 (2002).

    MathSciNet  MATH  Google Scholar 

  4. Etzion T., Vardy A.: Error correcting codes in projective space. IEEE Trans. Inf. Theory 57, 1165–1173 (2011).

    Article  MathSciNet  MATH  Google Scholar 

  5. Gluesing-Luerssen H., Morrison K., Troha C.: Cyclic orbit codes and stabilizer subfields. Adv. Math. Commun. 25, 177–197 (2015).

    Article  MathSciNet  MATH  Google Scholar 

  6. Kohnert A., Kurz S.: Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance. In: Lecture Notes in Computer Science, vol. 5393, pp. 31–42, Springer, Berlin (2008).

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Klein A., Metsch K., Storme L.: Small maximal partial spreads in classical finite polar spaces. Adv. Geom. 10, 379–402 (2010).

    Article  MathSciNet  MATH  Google Scholar 

  9. Lidl R., Niederreiter H.: Finite Fields. Encyclopedia of Mathematics and Its ApplicationsCambridge University Press, Cambridge (1997).

    MATH  Google Scholar 

  10. Ore O.: On a special class of polynomials. Trans. Am. Math. Soc. 35, 559–584 (1933).

    Article  MathSciNet  MATH  Google Scholar 

  11. Trautmann A.-L., Manganiello F., Braun M., Rosenthal J.: Cyclic orbit codes. IEEE Trans. Inf. Theory 59, 7386–7404 (2013).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

We would like to thank the anonymous referees for their insightful and helpful comments that improved the presentation of this paper. In addition, we would like to thank COST Action IC 1104 and the first author thanks TÜBİTAK BİDEB 2211.

Author information

Authors and Affiliations

  1. Department of Mathematics and Institute of Applied Mathematics, Middle East Technical University, Dumlupınar Bulvarı No. 1, 06800, Ankara, Turkey

    Kamil Otal & Ferruh Özbudak

Authors
  1. Kamil Otal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ferruh Özbudak
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ferruh Özbudak.

Additional information

Communicated by C. Mitchell.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Otal, K., Özbudak, F. Cyclic subspace codes via subspace polynomials. Des. Codes Cryptogr. 85, 191–204 (2017). https://doi.org/10.1007/s10623-016-0297-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-016-0297-1

Keywords

Mathematics Subject Classification

Search

Navigation