English

Linear complementary dual, maximum distance separable codes

Information Theory 2020-05-19 v3 math.IT

Abstract

Linear complementary dual (LCD) maximum distance separable (MDS) codes are constructed to given specifications. For given nn and r<nr<n, with nn or rr (or both) odd, MDS LCD (n,r)(n,r) codes are constructed over finite fields whose characteristic does not divide nn. Series of LCD MDS codes are constructed to required rate and required error-correcting capability. Given the field GF(q)GF(q) and n/(q1)n/(q-1), LCD MDS codes of length nn and dimension rr are explicitly constructed over GF(q)GF(q) for all r<nr<n when nn is odd and for all odd r<nr<n when nn is even. For given dimension and given error-correcting capability LCD MDS codes are constructed to these specifications with smallest possible length. Series of asymptotically good LCD MDS codes are explicitly constructed. Efficient encoding and decoding algorithms exist for all the constructed codes. Linear complementary dual codes have importance in data storage, communications' systems and security.

Keywords

Cite

@article{arxiv.1901.04241,
  title  = {Linear complementary dual, maximum distance separable codes},
  author = {Ted Hurley},
  journal= {arXiv preprint arXiv:1901.04241},
  year   = {2020}
}

Comments

Small changes from previous version