DECODING OF ORBIT CODES

Year 2019, Volume: 9 Issue: 2, 225 - 236, 01.06.2019

M. H. Poroch A. A. Talebi

Abstract

Subspace codes have gained considerable attention during the last decade due to their crucial role in random network coding. Subspace codes are defined as sets of vector spaces over a finite field. Subspace codes can be used to correct errors and erasures in network with linear network coding. Networks are exposed to noise such that messages can be lost or modified during the transmission of subspace V. Therefore some vectors of V might be lost and we will received smaller subspace V 0 < V. On the other hand, vectors which are not contained in V might be received. These erroneous vectors span a vector space E, thus R = V 0 ⊕ E will be received. In fact, there are two types of errors that may occur during transmission, a decrease in dimension, which is called an erasure and an increase in dimension, called an insertion

Keywords

Subspace codes, Constant dimension subspace codes, Grassmannian, Group action, Orbit codes.

References

• [1] Elsenhans, A., Kohnert, A. and Wassermann, A., (2010), Construction of codes for network coding, Proceedings of the 19th International Symposium on Mathematical Theory of Networks and SystemsMTNS (Budapest, Hungary), pp. 1811-1814.
• [2] Ghatak, A., (2014), Construction of Singer Subgroup Orbit Codes Based on Cyclic Different Sets, 20 national conference on communications.
• [3] Gluesing-Luerssen, H., Morrison, K. and Troha, C., (2014), Cyclic orbit codes and stabilizer subfields. arXiv:1403.1218.
• [4] Herstein, I. N., (1975), Topics in algebra. 2nd ed. Lexington, Mass.: Xerox College Publishing.
• [5] Jungnickel, D., (1993), Finite fields, structure and arithmetic, BI-Wiss.-Verl.
• [6] Kerber, A., (1999), Applied Finite Group Actions, Algorithms and Combinatorics, Vol. 19, SpringerVerlag.
• [7] Lidl, R. and Niederreiter, H., (1994), Introduction to Finite Fields and their applications. Cambridge University Press, Cambridge, London, Revised edition.
• [8] Trautmann, A. L. and Rosenthal, J., (2011), A Complete Characterization of Irreducible Cyclic Orbit Codes. In Proceedings of the Seventh International Workshop on Coding and Cryptography-WCC 2011, pp. 219-228.
• [9] Trautmann, A. L., Manganiello, F., Braun, M. and Rosenthal, J., (2013), Cyclic Orbit Codes. IEEE Transactions on Information Theory, no. 99, pp. 1-18.
• [10] Trautmann, A. L., Manganiello, F. and Rosenthal, J., (2010), Orbit codes-a new concept in the area of network coding. In IEEE Information Theory Workshop, Dublin, Ireland, pp. 1-4.