Rank q-cyclic and pseudo-q-cyclic codes

@article{Gabidulin2009RankQA,
  title={Rank q-cyclic and pseudo-q-cyclic codes},
  author={Ernst M. Gabidulin},
  journal={2009 IEEE International Symposium on Information Theory},
  year={2009},
  pages={2799-2802}
}
In the theory of codes based on Hamming metric, three classes of codes are well known: cyclic codes, shortened cyclic codes and pseudo-cyclic codes. An important result is that the class of linear shortened cyclic codes coincides with the class of linear pseudo-cyclic codes [1]. No similar results are known in the theory of rank-metric based codes. In this paper, we generalize the notion of q-cyclic codes and introduce two new families of codes, namely, shortened q-cyclic codes and pseudo-q… CONTINUE READING

From This Paper

Topics from this paper.
3 Citations
7 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Maximum Rank Codes as Space-Time Codes

  • E M.Gabidulin, P. Lusina, M. Bossert
  • IEEE Trans. Inform. Theory,
  • 2003
1 Excerpt

Theory of codes with maximal rank distance

  • E M.Gabidulin
  • Problems of Information Transmission,
  • 1985
1 Excerpt

Error-correcting codes.

  • W W.Peterson
  • 1961
1 Excerpt

Theory of non-commutative polynomials

  • Ö. Ore
  • Ann. of Math.,
  • 1933
1 Excerpt

Similar Papers

Loading similar papers…