Saurabh Tiwary

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
—Generation of optimal codes is a well known problem in coding theory. Many computational approaches exist in the literature for finding record breaking codes. However generating codes with long lengths n using serial algorithms is computationally very expensive, for example the worst case time complexity of a Greedy algorithm is O(n 4 n). In order to(More)
  • 1