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

2023/03/13 by Yang, Tianshuo
#Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.2303.06889

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öbner bases to compute solutions for systems of polynomial equations

Related

• Unique and Minimum Distance Decoding of Linear Codes with Reduced Complexity
• A simple coding-decoding algorithm for the Hamming code
• An Improved Linear Programming Bound on the Average Distance of a Binary Code
• Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes
• The Partial-Inverse Approach to Linearized Polynomials and Gabidulin Codes With Applications to Network Coding