Abstract
In this paper, the subspace subcodes of generalized Reed-Solomn codes are introduced and the fomulas to compute the dimensions of these codes are given.
Similar content being viewed by others
References
G.D. Forney, Jr. Dimension/length Profiles and Trellis Complexity of Linear Block Codes.IEEE Trans. Inform. Theory, 1994, 40: 1741–1752
E.R. Berlekamp. Algebraic Coding Theory, Revised 1984 Edition. Laguna Hills, CA: Aegean Park, 1984
M. Hattori, R.J. McElience, G. Solomon. Subspace Subcodes of Reed-Solomon Codes.IEEE Trans. Inform. Theory, 1998, 44: 1861–1880
J.M. Jensen. Subgroup Subcodes.IEEE Trans. Inform. Theory, 1995, 41: 781–785
F.J. Macwilliams, N.J.A. Sloane. The Theory of Error-Correcting Codes. Elsevier, North-Holland, Amsterdam, 1977
R.J. McElience. Finite Field for Computer Scientists and Engineers. Kluwer, Boston, 1987
R.J. McElience, G. Solomon. Trace-shortened Reed-Solomon codes. In: Proc. 2nd Int. Symp. Communication Theory and Applications, Ambleside, UK, 1993
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jie, C., Junying, P. Subspace subcodes of generalized reed-solomon codes. Acta Mathematicae Applicatae Sinica 17, 503–508 (2001). https://doi.org/10.1007/BF02669703
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02669703