Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014, Article ID 497958, 9 pages
http://dx.doi.org/10.1155/2014/497958
Research Article

Bounds on Subspace Codes Based on Subspaces of Type in Singular Linear Space

College of Science, Civil Aviation University of China, Tianjin 300300, China

Received 7 March 2014; Revised 7 July 2014; Accepted 15 July 2014; Published 5 August 2014

Academic Editor: Qi Cheng

Copyright © 2014 You Gao and Gang Wang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. Koetter and F. R. Kschischang, “Coding for errors and erasures in random network coding,” IEEE Transactions on Information Theory, vol. 54, no. 8, pp. 3579–3591, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. R. Ahlswede, N. Cai, and S. R. a. Li, “Network information flow,” IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1204–1216, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. M. Gadouleau and Z. Yan, “Packing and covering properties of subspace codes for error control in random linear network coding,” IEEE Transactions on Information Theory, vol. 56, no. 5, pp. 2097–2108, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  4. R. Koetter and F. R. Kschischang, “Error correction in random network,” in Proceedings of the 2nd Annual Workshop on Information Theory and Applications, La Jolla, Calif, USA, 2007.
  5. T. Ho, M. Médard, R. Koetter et al., “A random linear network coding approach to multicast,” IEEE Transactions on Information Theory, vol. 52, no. 10, pp. 4413–4430, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. D. Silva, F. R. Kschischang, and R. Koetter, “A rank-metric approach to error control in random network coding,” IEEE Transactions on Information Theory, vol. 54, no. 9, pp. 3951–3967, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. E. M. Gabidulin and M. Bossert, “Codes for network coding,” in Proceedings of the IEEE International Symposium on Information Theory (ISIT '08), pp. 867–870, Toronto, Canada, July 2008. View at Publisher · View at Google Scholar · View at Scopus
  8. M. Gadouleau and Z. Yan, “Constant-rank codes,” in Proceedings of the IEEE International Symposium on Information Theory (ISIT '08), pp. 876–880, Toronto, Canada, July 2008. View at Publisher · View at Google Scholar · View at Scopus
  9. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, The Netherlands, 1977.
  10. H. Wang, C. Xing, and R. Safavi-Naini, “Linear authentication codes: bounds and constructions,” IEEE Transactions on Information Theory, vol. 49, no. 4, pp. 866–872, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. T. Etzion and A. Vardy, “Error-correcting codes in projective space,” IEEE Transactions on Information Theory, vol. 57, no. 2, pp. 1165–1173, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. S. T. Xia and F. W. Fu, “Johnson type bounds on constant dimension codes,” Designs, Codes and Cryptography, vol. 50, no. 2, pp. 163–172, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. M. Schwartz and T. Etzion, “Codes and anticodes in the Grassman graph,” Journal of Combinatorial Theory A, vol. 97, no. 1, pp. 27–42, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. T. Etzion, “Perfect byte-correcting codes,” IEEE Transactions on Information Theory, vol. 44, no. 7, pp. 3140–3146, 1998. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. K. Wang, J. Guo, and F. Li, “Singular linear space and its applications,” Finite Fields and Their Applications, vol. 17, no. 5, pp. 395–406, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. Z. Wan, Geometry of Classical Groups Over Finite Fields, Science Press, Beijing, China, 2nd edition, 2002.