New Proof of Minimum Distance for Binary Cyclic Codes with dmin = 5
Vol. 25, No. 10, pp. 1576-1581, Oct. 2000
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.
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]
정하봉 and 노종선, "New Proof of Minimum Distance for Binary Cyclic Codes with dmin = 5," The Journal of Korean Institute of Communications and Information Sciences, vol. 25, no. 10, pp. 1576-1581, 2000. DOI: .
[ACM Style]
정하봉 and 노종선. 2000. New Proof of Minimum Distance for Binary Cyclic Codes with dmin = 5. The Journal of Korean Institute of Communications and Information Sciences, 25, 10, (2000), 1576-1581. DOI: .
[KICS Style]
정하봉 and 노종선, "New Proof of Minimum Distance for Binary Cyclic Codes with dmin = 5," The Journal of Korean Institute of Communications and Information Sciences, vol. 25, no. 10, pp. 1576-1581, 10. 2000.
pISSN : 1226 - 4717
eISSN : 2287 - 3880