Minimum distance computation of linear codes via genetic algorithms with permutation encoding
From MaRDI portal
Abstract: We design a heuristic method, a genetic algorithm, for the computation of an upper bound of the minimum distance of a linear code over a finite field. By the use of the row reduced echelon form, we obtain a permutation encoding of the problem, so that its space of solutions does not depend on the size of the base field or the dimension of the code. Actually, the efficiency of our method only grows non-polynomially with respect to the length of the code.
Recommendations
- scientific article; zbMATH DE number 2077078
- Efficient dual domain decoding of linear block codes using genetic algorithms
- Some algorithms for computing the minimum distance of evaluation codes
- On the minimum average distance of binary codes: Linear programming approach
- A simple deterministic reduction for the gap minimum distance of code problem
- A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem
- Searching for linear codes with large minimum distance
- On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices
- A family of distance-optimal minimal linear codes with flexible parameters
Cited in
(4)- Algorithm 994: Fast implementations of the Brouwer-Zimmermann algorithm for the computation of the minimum distance of a random linear code
- Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\)
- Efficient dual domain decoding of linear block codes using genetic algorithms
- scientific article; zbMATH DE number 1703854 (Why is no real title available?)
This page was built for publication: Minimum distance computation of linear codes via genetic algorithms with permutation encoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4630314)
