Abstract
Firstly, the Fourier transforms in finite fields and the concept of linear complexity of sequences are described. Then several known lower bounds on the minimum distance of cyclic codes are outlined. Finally, the minimum distance of cyclic codes is analyzed via linear complexity of sequences, and new theorems about the lower bounds are obtained.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. E. Blahut, Theory and Practice of Error Control Codes, London, Addison-Wesley, 1983.
R. E. Blahut,IBM J. Res. Develop. 23(1979), 299–315.
T. Schaub, J. L. Massey, Bounds on the Minimum Distance of Cyclic Codes via Bounds on the Linear Complexity of Sequences, (internal exchange), 1987.
Li Yuanxing,Journal of Xidian University,17(1990)2.
Li Yuanxing, Proceedings of BIWIT’88, Beijing, 1988.
M. L. Loeion, J. Conan,IEEE Trans. on IT.,IT-33(1987)1, 105–115.
Li Yuanxing,Journal of Xidian University,16(1989)1, 105–115.
Li Yuanxing, Proceedings of ICCT’89, Beijing, 1989.
R. C. Bose, et al.,Information Control,3(1960), 279–290.
C. R. P. Hartman, K. K. Tzeng,Information Control,20(1972)5, 489–498.
C. Roos,Journal of Com. Theory, Ser. A,40(1982), 229–232.
C. Roos,IEEE Trans. on IT,IT-29(1983)3, 330–332.
Author information
Authors and Affiliations
About this article
Cite this article
Yuanxing, L., Chuanjia, L. The application of linear complexity of sequences to lower bounds on the minimum distance of cyclic codes. J. of Electron.(China) 7, 312–316 (1990). https://doi.org/10.1007/BF02892754
Issue Date:
DOI: https://doi.org/10.1007/BF02892754