Abstract

This paper presents a new method of constructing good binary linear codes. The proposed method is first based on the BCH codes parity matrix and Hadamard’s matrix, and after on a GUAVA-based computer search, which allowed us to find several good codes with rates >0.5.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call