Reconstruction of Linear Cyclic Codes 


Vol. 36,  No. 10, pp. 605-613, Oct.  2011


PDF
  Abstract

In most digital communication systems over the noisy channel, some form of forward error correction scheme is employed for reliable communications. If one wants to recover the transmitted message without any knowledge of the error correcting codes employed, it is of utmost importance to figure out and reconstruct the error correcting codes. In this paper, we propose two algorithms of reconstructing linear cyclic codes from the corrupted received bit sequence, one for general linear binary cyclic codes and the other for Reed-Solomon codes. For two algorithms, we ran computer simulations and the performances are shown to be superior to those with the conventional LWM method.

  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]

H. Chung, H. Jang, W. Cho, C. Park, "Reconstruction of Linear Cyclic Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 10, pp. 605-613, 2011. DOI: .

[ACM Style]

Habong Chung, Hwanseok Jang, Won-chan Cho, and Cheol-sun Park. 2011. Reconstruction of Linear Cyclic Codes. The Journal of Korean Institute of Communications and Information Sciences, 36, 10, (2011), 605-613. DOI: .

[KICS Style]

Habong Chung, Hwanseok Jang, Won-chan Cho, Cheol-sun Park, "Reconstruction of Linear Cyclic Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 10, pp. 605-613, 10. 2011.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880