at Google ScholarTitle data
Zwanzger, Johannes:
A heuristic algorithm for the construction of good linear codes.
In: IEEE Transactions on Information Theory.
Vol. 54
(2008)
Issue 5
.
- pp. 2388-2392.
ISSN 0018-9448
DOI: https://doi.org/10.1109/TIT.2008.920323
Abstract in another language
In this correspondence, we describe a heuristic method for the construction of linear codes with given parameters n, k, q, and a prescribed minimum distance of at least d. Our approach is based on a function estimating the probability that a code of dimension k and blocklength n' < n over GF( q) is extendable to a code with the given properties. Combining this evaluation function with a search algorithm, we were able to improve 40 entries in the international tables for the best known minimum distance in the cases q = 2, 5, 7, 9 and found at least two new optimal linear codes.
Further data
| Item Type: | Article in a journal |
|---|---|
| Refereed: | Yes |
| Keywords: | Coding theory, extension, heuristic algorithm, high minimum distance, linear codes, weight distribution |
| Institutions of the University: | Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematics II (Computer Algebra) Faculties Faculties > Faculty of Mathematics, Physics und Computer Science Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics |
| Result of work at the UBT: | Yes |
| DDC Subjects: | 500 Science > 510 Mathematics |
| Date Deposited: | 22 Jan 2015 12:15 |
| Last Modified: | 22 Jan 2015 12:16 |
| URI: | https://eref.uni-bayreuth.de/id/eprint/5830 |