Construction of [2k-1+k, k, 2k-1+1] Codes Attaining Griesmer Bound and Its Locality

Jung-Hyun Kim; Mi-Young Nam; Ki-Hyeon Park; Hong-Yeop Song

Construction of [2^k-1+k, k, 2^k-1+1] Codes Attaining Griesmer Bound and Its Locality

Vol. 40, No. 3, pp. 491-496, Mar. 2015

PDF

Abstract

In this paper, we introduce two classes of optimal codes, [2k-1, k, 2k-1] simplex codes and [2k-1+k, k, 2k-1+1] codes, attaining Griesmer bound with equality. We further present and compare the locality of them. The [2k-1+k, k, 2k-1+1] codes have good locality property as well as optimal code length with given code dimension and minimum distance. Therefore, we expect that [2k-1+k, k, 2k-1+1] codes can be applied to various distributed storage systems.

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]

J. Kim, M. Nam, K. Park, H. Song, "Construction of [2^k-1+k, k, 2^k-1+1] Codes Attaining Griesmer Bound and Its Locality," The Journal of Korean Institute of Communications and Information Sciences, vol. 40, no. 3, pp. 491-496, 2015. DOI: .

[ACM Style]

Jung-Hyun Kim, Mi-Young Nam, Ki-Hyeon Park, and Hong-Yeop Song. 2015. Construction of [2^k-1+k, k, 2^k-1+1] Codes Attaining Griesmer Bound and Its Locality. The Journal of Korean Institute of Communications and Information Sciences, 40, 3, (2015), 491-496. DOI: .

[KICS Style]

Jung-Hyun Kim, Mi-Young Nam, Ki-Hyeon Park, Hong-Yeop Song, "Construction of [2^k-1+k, k, 2^k-1+1] Codes Attaining Griesmer Bound and Its Locality," The Journal of Korean Institute of Communications and Information Sciences, vol. 40, no. 3, pp. 491-496, 3. 2015.