Bounds on Minimum Distance for Linear Codes over GF.
Let [n, k, d; q]-codes be linear codes of length n, dimension k and minimum Hamming distance d over GF(q). Let d 5(n, k) be the maximum possible minimum Hamming distance of a linear [n, k, d; 5]-code for given values of n and k. In this paper, forty four new linear codes over GF(5) are constructed...
| Publié dans: | Applicable algebra in engineering, communication and computing. 9, 6 (1999). |
|---|---|
| Auteur principal: | |
| Autres auteurs: | |
| Format: | Article |
| Langue: | English |
| Sujets: |