American Institute of Mathematical Sciences

Advanced
May  2013, 7(2): 147-160. doi: 10.3934/amc.2013.7.147

Isometry and automorphisms of constant dimension codes

Anna-Lena Trautmann 1,

1. 

Institute of Mathematics, University of Zurich, Switzerland

Received  June 2012 Published  May 2013

We define linear and semilinear isometry for general subspace codes, used for random network coding. Furthermore, some results on isometry classes and automorphism groups of known constant dimension code constructions are derived.
Keywords: Random network coding, finite fields, Grassmannian, projective space, automorphism groups., isometries, constant dimension codes.
Mathematics Subject Classification: 11T71, 14G5.
Citation: Anna-Lena Trautmann. Isometry and automorphisms of constant dimension codes. Advances in Mathematics of Communications, 2013, 7 (2) : 147-160. doi: 10.3934/amc.2013.7.147
References:
[1]

R. Ahlswede, N. Cai, S.-Y. R. Li and R. W. Yeung, Network information flow, IEEE Trans. Inform. Theory, 46 (2000), 1204-1216. doi: 10.1109/18.850663.  Google Scholar

[2]

E. Artin, Geometric algebra, in "Interscience Tracts in Pure and Applied Mathematics,'' John Wiley & Sons, 1988.  Google Scholar

[3]

R. Baer, Linear algebra and projective geometry, in "Pure and Applied Mathematics,'' Academic Press, 1952.  Google Scholar

[4]

T. P. Berger, Isometries for rank distance and permutation group of gabidulin codes, IEEE Trans. Inform. Theory, 49 (2003), 3016-3019. doi: 10.1109/TIT.2003.819322.  Google Scholar

[5]

T. Etzion and N. Silberstein, Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams, IEEE Trans. Inform. Theory, 55 (2009), 2909-2919. doi: 10.1109/TIT.2009.2021376.  Google Scholar

[6]

T. Etzion and A. Vardy, Error-correcting codes in projective space, in "IEEE International Symposium on Information Theory,'' (2008), 871-875. Google Scholar

[7]

T. Feulner, Canonical forms and automorphisms in the projective space, preprint, 2012. Google Scholar

[8]

E. M. Gabidulin, Theory of codes with maximum rank distance, Problemy Peredachi Informatsii, 21 (1985), 3-16.  Google Scholar

[9]

E. Gorla, F. Manganiello and J. Rosenthal, An algebraic approach for decoding spread codes, Adv. Math. Commun., 6 (2012), 443-466. doi: 10.3934/amc.2012.6.443.  Google Scholar

[10]

J. W. P. Hirschfeld, "Finite Projective Spaces of Three Dimensions,'' The Clarendon Press, Oxford University Press, New York, 1985.  Google Scholar

[11]

J. W. P. Hirschfeld, "Projective Geometries over Finite Fields,'' 2nd edition, The Clarendon Press, Oxford University Press, New York, 1998.  Google Scholar

[12]

J. W. P. Hirschfeld and J. A. Thas, "General Galois Geometries,'' The Clarendon Press, Oxford University Press, New York, 1991.  Google Scholar

[13]

A. Khaleghi, D. Silva and F. R. Kschischang, Subspace codes, in "IMA Int. Conf.,'' (2009), 1-21.  Google Scholar

[14]

A. Kohnert and S. Kurz, Construction of large constant dimension codes with a prescribed minimum distance, in "Mathematical Methods in Computer Science,'' Springer, Berlin, (2008), 31-42. doi: 10.1007/978-3-540-89994-5_4.  Google Scholar

[15]

R. Kötter and F. R. Kschischang, Coding for errors and erasures in random network coding, IEEE Trans. Inform. Theory, 54 (2008), 3579-3591. doi: 10.1109/TIT.2008.926449.  Google Scholar

[16]

F. Manganiello, E. Gorla and J. Rosenthal, Spread codes and spread decoding in network coding, in "Proceedings of the 2008 IEEE International Symposium on Information Theory,'' Toronto, (2008), 851-855. doi: 10.1109/ISIT.2008.4595113.  Google Scholar

[17]

F. Manganiello and A.-L. Trautmann, Spread decoding in extension fields,, preprint, ().   Google Scholar

[18]

D. Silva and F. R. Kschischang, On metrics for error correction in network coding, IEEE Trans. Inform. Theory, 55 (2009), 5479-5490. doi: 10.1109/TIT.2009.2032817.  Google Scholar

[19]

D. Silva, F. R. Kschischang and R. Kötter, A rank-metric approach to error control in random network coding, IEEE Trans. Inform. Theory, 54 (2008), 3951-3967. doi: 10.1109/TIT.2008.928291.  Google Scholar

[20]

V. Skachek, Recursive code construction for random networks, IEEE Trans. Inform. Theory, 56 (2010), 1378-1382. doi: 10.1109/TIT.2009.2039163.  Google Scholar

[21]

A.-L. Trautmann, F. Manganiello, M. Braun and J. Rosenthal, Cyclic orbit codes,, preprint, ().   Google Scholar

[22]

A.-L. Trautmann, F. Manganiello and J. Rosenthal, Orbit codes - a new concept in the area of network coding, in "IEEE Information Theory Workshop (ITW),'' Dublin, (2010), 1-4. Google Scholar

show all references

References:
[1]

R. Ahlswede, N. Cai, S.-Y. R. Li and R. W. Yeung, Network information flow, IEEE Trans. Inform. Theory, 46 (2000), 1204-1216. doi: 10.1109/18.850663.  Google Scholar

[2]

E. Artin, Geometric algebra, in "Interscience Tracts in Pure and Applied Mathematics,'' John Wiley & Sons, 1988.  Google Scholar

[3]

R. Baer, Linear algebra and projective geometry, in "Pure and Applied Mathematics,'' Academic Press, 1952.  Google Scholar

[4]

T. P. Berger, Isometries for rank distance and permutation group of gabidulin codes, IEEE Trans. Inform. Theory, 49 (2003), 3016-3019. doi: 10.1109/TIT.2003.819322.  Google Scholar

[5]

T. Etzion and N. Silberstein, Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams, IEEE Trans. Inform. Theory, 55 (2009), 2909-2919. doi: 10.1109/TIT.2009.2021376.  Google Scholar

[6]

T. Etzion and A. Vardy, Error-correcting codes in projective space, in "IEEE International Symposium on Information Theory,'' (2008), 871-875. Google Scholar

[7]

T. Feulner, Canonical forms and automorphisms in the projective space, preprint, 2012. Google Scholar

[8]

E. M. Gabidulin, Theory of codes with maximum rank distance, Problemy Peredachi Informatsii, 21 (1985), 3-16.  Google Scholar

[9]

E. Gorla, F. Manganiello and J. Rosenthal, An algebraic approach for decoding spread codes, Adv. Math. Commun., 6 (2012), 443-466. doi: 10.3934/amc.2012.6.443.  Google Scholar

[10]

J. W. P. Hirschfeld, "Finite Projective Spaces of Three Dimensions,'' The Clarendon Press, Oxford University Press, New York, 1985.  Google Scholar

[11]

J. W. P. Hirschfeld, "Projective Geometries over Finite Fields,'' 2nd edition, The Clarendon Press, Oxford University Press, New York, 1998.  Google Scholar

[12]

J. W. P. Hirschfeld and J. A. Thas, "General Galois Geometries,'' The Clarendon Press, Oxford University Press, New York, 1991.  Google Scholar

[13]

A. Khaleghi, D. Silva and F. R. Kschischang, Subspace codes, in "IMA Int. Conf.,'' (2009), 1-21.  Google Scholar

[14]

A. Kohnert and S. Kurz, Construction of large constant dimension codes with a prescribed minimum distance, in "Mathematical Methods in Computer Science,'' Springer, Berlin, (2008), 31-42. doi: 10.1007/978-3-540-89994-5_4.  Google Scholar

[15]

R. Kötter and F. R. Kschischang, Coding for errors and erasures in random network coding, IEEE Trans. Inform. Theory, 54 (2008), 3579-3591. doi: 10.1109/TIT.2008.926449.  Google Scholar

[16]

F. Manganiello, E. Gorla and J. Rosenthal, Spread codes and spread decoding in network coding, in "Proceedings of the 2008 IEEE International Symposium on Information Theory,'' Toronto, (2008), 851-855. doi: 10.1109/ISIT.2008.4595113.  Google Scholar

[17]

F. Manganiello and A.-L. Trautmann, Spread decoding in extension fields,, preprint, ().   Google Scholar

[18]

D. Silva and F. R. Kschischang, On metrics for error correction in network coding, IEEE Trans. Inform. Theory, 55 (2009), 5479-5490. doi: 10.1109/TIT.2009.2032817.  Google Scholar

[19]

D. Silva, F. R. Kschischang and R. Kötter, A rank-metric approach to error control in random network coding, IEEE Trans. Inform. Theory, 54 (2008), 3951-3967. doi: 10.1109/TIT.2008.928291.  Google Scholar

[20]

V. Skachek, Recursive code construction for random networks, IEEE Trans. Inform. Theory, 56 (2010), 1378-1382. doi: 10.1109/TIT.2009.2039163.  Google Scholar

[21]

A.-L. Trautmann, F. Manganiello, M. Braun and J. Rosenthal, Cyclic orbit codes,, preprint, ().   Google Scholar

[22]

A.-L. Trautmann, F. Manganiello and J. Rosenthal, Orbit codes - a new concept in the area of network coding, in "IEEE Information Theory Workshop (ITW),'' Dublin, (2010), 1-4. Google Scholar

[1]

Heide Gluesing-Luerssen, Hunter Lehmann. Automorphism groups and isometries for cyclic orbit codes. Advances in Mathematics of Communications, 2021  doi: 10.3934/amc.2021040
[2]

Daniele Bartoli, Adnen Sboui, Leo Storme. Bounds on the number of rational points of algebraic hypersurfaces over finite fields, with applications to projective Reed-Muller codes. Advances in Mathematics of Communications, 2016, 10 (2) : 355-365. doi: 10.3934/amc.2016010
[3]

David Grant, Mahesh K. Varanasi. Duality theory for space-time codes over finite fields. Advances in Mathematics of Communications, 2008, 2 (1) : 35-54. doi: 10.3934/amc.2008.2.35
[4]

Natalia Silberstein, Tuvi Etzion. Large constant dimension codes and lexicodes. Advances in Mathematics of Communications, 2011, 5 (2) : 177-189. doi: 10.3934/amc.2011.5.177
[5]

David Grant, Mahesh K. Varanasi. The equivalence of space-time codes and codes defined over finite fields and Galois rings. Advances in Mathematics of Communications, 2008, 2 (2) : 131-145. doi: 10.3934/amc.2008.2.131
[6]

Thomas Feulner. The automorphism groups of linear codes and canonical representatives of their semilinear isometry classes. Advances in Mathematics of Communications, 2009, 3 (4) : 363-383. doi: 10.3934/amc.2009.3.363
[7]

Nicola Pace, Angelo Sonnino. On the existence of PD-sets: Algorithms arising from automorphism groups of codes. Advances in Mathematics of Communications, 2021, 15 (2) : 267-277. doi: 10.3934/amc.2020065
[8]

Somphong Jitman, Ekkasit Sangwisut. The average dimension of the Hermitian hull of constacyclic codes over finite fields of square order. Advances in Mathematics of Communications, 2018, 12 (3) : 451-463. doi: 10.3934/amc.2018027
[9]

Roland D. Barrolleta, Emilio Suárez-Canedo, Leo Storme, Peter Vandendriessche. On primitive constant dimension codes and a geometrical sunflower bound. Advances in Mathematics of Communications, 2017, 11 (4) : 757-765. doi: 10.3934/amc.2017055
[10]

Heide Gluesing-Luerssen. On isometries for convolutional codes. Advances in Mathematics of Communications, 2009, 3 (2) : 179-203. doi: 10.3934/amc.2009.3.179
[11]

Łukasz Struski, Jacek Tabor, Tomasz Kułaga. Cone-fields without constant orbit core dimension. Discrete & Continuous Dynamical Systems, 2012, 32 (10) : 3651-3664. doi: 10.3934/dcds.2012.32.3651
[12]

Shengtian Yang, Thomas Honold. Good random matrices over finite fields. Advances in Mathematics of Communications, 2012, 6 (2) : 203-227. doi: 10.3934/amc.2012.6.203
[13]

Daniele Bartoli, Matteo Bonini, Massimo Giulietti. Constant dimension codes from Riemann-Roch spaces. Advances in Mathematics of Communications, 2017, 11 (4) : 705-713. doi: 10.3934/amc.2017051
[14]

Ghislain Fourier, Gabriele Nebe. Degenerate flag varieties in network coding. Advances in Mathematics of Communications, 2021  doi: 10.3934/amc.2021027
[15]

Arvind Ayyer, Carlangelo Liverani, Mikko Stenlund. Quenched CLT for random toral automorphism. Discrete & Continuous Dynamical Systems, 2009, 24 (2) : 331-348. doi: 10.3934/dcds.2009.24.331
[16]

Fatma-Zohra Benahmed, Kenza Guenda, Aicha Batoul, Thomas Aaron Gulliver. Some new constructions of isodual and LCD codes over finite fields. Advances in Mathematics of Communications, 2019, 13 (2) : 281-296. doi: 10.3934/amc.2019019
[17]

Shudi Yang, Xiangli Kong, Xueying Shi. Complete weight enumerators of a class of linear codes over finite fields. Advances in Mathematics of Communications, 2021, 15 (1) : 99-112. doi: 10.3934/amc.2020045
[18]

Liren Lin, Hongwei Liu, Bocong Chen. Existence conditions for self-orthogonal negacyclic codes over finite fields. Advances in Mathematics of Communications, 2015, 9 (1) : 1-7. doi: 10.3934/amc.2015.9.1
[19]

Stéphane Sabourau. Growth of quotients of groups acting by isometries on Gromov-hyperbolic spaces. Journal of Modern Dynamics, 2013, 7 (2) : 269-290. doi: 10.3934/jmd.2013.7.269
[20]

Keisuke Minami, Takahiro Matsuda, Tetsuya Takine, Taku Noguchi. Asynchronous multiple source network coding for wireless broadcasting. Numerical Algebra, Control & Optimization, 2011, 1 (4) : 577-592. doi: 10.3934/naco.2011.1.577

2020 Impact Factor: 0.935

Tools

Metrics

  • PDF downloads (196)
  • HTML views (0)
  • Cited by (8)

Other articles
by authors

[Back to Top]

Copyright © 2021 American Institute of Mathematical Sciences