Skip to main content
Log in

New Constructions of Orbit Codes Based on the Operations of Orbit Codes

  • Published:
Acta Mathematicae Applicatae Sinica, English Series Aims and scope Submit manuscript

Abstract

An orbit code is a special constant dimension subspace code, which is an orbit of a subgroup of a general linear group acting on the set of all subspaces in the given ambient space. This paper presents some methods of constructing new orbit codes from known orbit codes. Firstly, we introduce the sum operation, intersection operation and union operation of subspace codes, and then we give some methods to obtain new orbit codes from known orbit codes by fully applying the sub-orbits of permutation groups and the direct product operation of the groups. Finally, as a special application, partial spread codes are researched and a condition of orbit codes with constant distance is given.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Ahlswede, Cai, N., Li, S., Yang, W. Network information flow. IEEE Transactions on Information Theory, 46: 1204–1216 (2000)

    Article  MathSciNet  Google Scholar 

  2. Cai, N., Li, S., Yang, W. Linear network coding. IEEE Transactions on Information Theory, 49: 371–3819 (2003)

    Article  MathSciNet  Google Scholar 

  3. Koetter, R., Medard, M. An algebraic approach to network coding. IEEE Transactions on Networking, 11: 782–795 (2003)

    Article  Google Scholar 

  4. Kotter, R., Kschischang, F.R. Coding for errors and erasures in random network coding. IEEE Transactions on Information Theory, 54: 3579–3591 (2007)

    Article  MathSciNet  Google Scholar 

  5. Xia, S.T., Fu, F.W. Johnson type bounds on constant dimension codes. Designs Codes and Cryptography, 50: 163–172 (2009)

    Article  MathSciNet  Google Scholar 

  6. Trautmann, A.L., Manganiello, F., Rosenthal, J. Orbit codes-a new concept in the area of network coding. Information Theory Workshop, 23: 1–4 (2010)

    Google Scholar 

  7. Etzion, T., Vardy, A. Error-correcting codes in projective space. IEEE Transactions on Information Theory, 57: 1165–1173 (2011)

    Article  MathSciNet  Google Scholar 

  8. Guang, X., Fu, F.W., Zhang, Z. Construction of network error-correction codes in packet network. International Symposium on Networking Coding, 59: 1–6 (2011)

    Google Scholar 

  9. Trautmann, A.L., Manganiello, F., Braun, M., Rosenthal, J. Cyclic orbit codes. IEEE Transactions on Information Theory, 59: 7386–7404 (2013)

    Article  MathSciNet  Google Scholar 

  10. Rosenthal, J., Trautmann, A.L. A complete characterization of irreducible cyclic orbit codes and their Plücker embedding. Designs, Codes and Cryptography, 66: 275–289 (2013)

    Article  MathSciNet  Google Scholar 

  11. Silberstein, N., Trautmann, A.L. New lower bounds for constant dimension codes. IEEE International Symposium on Information Theory, 514–518 (2013)

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

    Article  MathSciNet  Google Scholar 

  13. Silberstein, N., Trautmann, A.L. Subspace codes based on graph matchings, ferrers diagrams, and pending blocks. IEEE Transactions on Information Theory, 61: 3937–3953 (2015)

    Article  MathSciNet  Google Scholar 

  14. Gluesing-Luerssen, H., Troha, C. Construction of subspace codes through linkage. Advances in Mathematics of Communications, 10: 525–540 (2017)

    Article  MathSciNet  Google Scholar 

  15. Cossidentee, A., Pavese, F. On subspace codes. Designd codes and cryptograthy, 78: 1–5 (2014)

    Google Scholar 

  16. Gao, Y., Zhao, L., Wang, G. Bounds on subspace codes based on totally isotropic subspaces in unitary spaces. Discrete Mathematics Algorithms and Applications, 8(4): 1650056 (2016)

    Article  MathSciNet  Google Scholar 

  17. Liu, S., Oggier, F. On application of orbit codes to storage. Advances in Mathematics of Communications, 10: 113–130 (2017)

    Article  MathSciNet  Google Scholar 

  18. Gluesing-Luerssen, H., Morrison, K., Troha, C. Cyclic orbit codes and stabilizer subfields. Advances in Mathematics of Communications, 9: 177–197 (2017)

    Article  MathSciNet  Google Scholar 

  19. Climent, J.J., Requena, V., Soler-Escrivà, X. A construction of Abelian non-cyclic orbit codes. Cryptography Communications, 4: 1–14 (2018)

    MATH  Google Scholar 

  20. Heinlein, D., Kiermaier, M., Kurz, S., Wassermann, A. Tables of subspace codes. arXiv:1601.02864v3

Download references

Acknowledgments

We wish to thank the editor and the referees for their valuable comments which enhanced the presentation of this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shang-di Chen.

Additional information

This paper is supported by the Fundamental Research Funds of the Central Universities of China Civil Aviation University of Key Projects of Natural Science (No. 3122019192).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chen, Sd., Liang, Jy. New Constructions of Orbit Codes Based on the Operations of Orbit Codes. Acta Math. Appl. Sin. Engl. Ser. 36, 803–815 (2020). https://doi.org/10.1007/s10255-020-0974-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10255-020-0974-8

Keywords

2000 MR Subject Classification

Navigation