Construction of Cyclic and Constacyclic Codes for b-symbol Read Channels Meeting the Plotkin-like Bound

10 Jul 2016 Yang Minghui Li Jin Feng Keqin

The symbol-pair codes over finite fields have been raised for symbol-pair read channels and motivated by application of high-density data storage technologies [1, 2]. Their generalization is the code for b-symbol read channels (b > 2)... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • INFORMATION THEORY
  • INFORMATION THEORY