On the k-Error Linear Complexity of pm-Periodic Binary Sequences and Its Applications to Binary Cyclic Codes 


Vol. 31,  No. 9, pp. 846-852, Sep.  2006


PDF
  Abstract

The k-error linear complexity is a key measure of the stability of the sequences used in the areas of communication systems, stream ciphers in cryptology and so on. This paper introduces an efficient algorithm to determine the k-error linear complexity and the corresponding error vectors of pm-periodic binary sequences, where is a prime and 2 is a primitive root modulo p². We also give a new sense about the -error linear complexity in viewpoint of coding theory instead of cryptographic results. We present an efficient algorithm for decoding binary cyclic codes of length pm and derive key properties of the minimum distance of these codes.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

Y. K. Han and K. Yang, "On the k-Error Linear Complexity of pm-Periodic Binary Sequences and Its Applications to Binary Cyclic Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 9, pp. 846-852, 2006. DOI: .

[ACM Style]

Yun Kyoung Han and Kyeongcheol Yang. 2006. On the k-Error Linear Complexity of pm-Periodic Binary Sequences and Its Applications to Binary Cyclic Codes. The Journal of Korean Institute of Communications and Information Sciences, 31, 9, (2006), 846-852. DOI: .

[KICS Style]

Yun Kyoung Han and Kyeongcheol Yang, "On the k-Error Linear Complexity of pm-Periodic Binary Sequences and Its Applications to Binary Cyclic Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 9, pp. 846-852, 9. 2006.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880