A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rate

  • Authors:

  • B. -Z. Shen

  • Affiliations:

  • Dept. of Math. & Comput. Sci., Eindhoven Univ. of Technol.

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 754.84

Visualization

Abstract

An explicit construction of a sequence of binary codes that asymptotically meet the Zyablov bound for rates lower than 0.30 is given by using Justesen's construction of concatenation. The outer codes are constructed from generalized Hermitian curves. These outer codes can be described without any algebraic geometry terminology, while the proofs of some properties deeply rely on algebraic geometry