Abstract
For the noncoherent transmission model for random linear network coding, that is, neither the source node nor sink nodes were assumed to have knowledge of the channel transfer characteristic, a totally different framework is formulated for network error correction co, which is called subspace codes. In this case, the source information is encoded as a subspace rather than a specific matrix, and the sink nodes also receive a subspace spanned by the received packets. In this chapter, we will introduce the basic theory of subspace codes, particularly, constant-dimension codes in which all codewords have the same dimension. Specifically, we describe the channel model, the basic theory of subspace codes including encoding and decoding principle, the bounds on subspace codes, code construction and decoding algorithms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
T. Etzion and N. Silberstein, “Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams,” IEEE Trans. Info. Theory, IT-55: 2909–2919, 2009.
T. Etzion and A. Vardy, “Error-Correcting Codes in Projective Space,” IEEE Trans. Info. Theory, IT-57: 1165–1173, 2011.
E. M. Gabidulin, “Theory of codes with maximum rank distance,” Probl. Inform. Transm., vol. 21, no. 1, pp. 1–12, Jan. 1985.
M. Gadouleau and Z. Yan, “Constant-Rank Codes and Their Connection to Constant-Dimension Codes,” IEEE Trans. Info. Theory, IT-56: 3207–3216, 2012.
A. Khaleghi, D. Silva, and F. R. Kschischang, “Subspace codes,” in Cryptography and Coding 2009, M. G. Parker Ed., Lecture Notes in Computer Science, vol. 5921, pp. 1–21, 2009.
R. Koetter and F. R. Kschischang, “Coding for errors and erasures in random network coding,” 2007 IEEE International Symposium on Information Theory, Nice, France, Jun. 2007.
R. Koetter and F. Kschischang, “Coding for errors and erasures in random network coding,” IEEE Trans. Info. Theory, IT-54: 3579–3591, 2008.
A. Kohnert and S. Kurz, “Construction of large constant dimension codes with a prescribed minimum distance,” Mathematical Methods in Computer Science: Essays in Memory of Thomas Beth, pp. 31–42, 2008.
H. Mahdavifar and A. Vardy, “Algebraic List-Decoding of Subspace Codes with Multiplicities,” 49th Annual Allerton Conference Communication, Control, and Computing, Illinois, USA, Sep. 2011.
H. Mahdavifar and A. Vardy, “List-decoding of Subspace Codes and Rank-Metric Codes up to Singleton Bound,” 2012 IEEE International Symposium on Information Theory, Cambridge, USA, July 2012.
D. Silva, “Error Control for Network Coding,” Ph.D. dissertation, University of Toronto, 2009.
D. Silva, F. R. Kschischang, and R. Kötter, “A Rank-Metric Approach to Error Control in Random Network Coding,” IEEE Trans. Info. Theory, IT-54: 3951–3967, 2008.
H. Wang, C. Xing, R. Safavi-Naini, “Linear authentication codes: bounds and constructions,” IEEE Trans. Info. Theory, IT-49: 866–872, 2003.
S.-T. Xia and F.-W. Fu,“Johnson type bounds on constant dimension codes,”, Designs, Codes and Cryptography, 50: 163–172, 2009.
H. Xie, J. Lin, Z. Yan, and B. Suter, “Linearized Polynomial Interpolation and Its Applications,” IEEE Trans. Signal Processing, 61: 206–217, 2013.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 The Author(s)
About this chapter
Cite this chapter
Guang, X., Zhang, Z. (2014). Subspace Codes. In: Linear Network Error Correction Coding. SpringerBriefs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-0588-1_6
Download citation
DOI: https://doi.org/10.1007/978-1-4939-0588-1_6
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-0587-4
Online ISBN: 978-1-4939-0588-1
eBook Packages: Computer ScienceComputer Science (R0)