21

Finding the minimum distance and decoding linear codes with Gaussian Elimination Method

Abstract

We propose an algorithm using the Gaussian elimination method to find the minimal Hamming distance and decode received messages of linear codes. This algorithm is easy to implement as it requires no Gr\"obner bases to compute solutions for systems of polynomial equations

View on arXiv
Comments on this paper