The Structure of 1-Generator Quasi-Twisted Codes and New Linear Codes
Designs, Codes and Cryptography
A search algorithm for linear codes: progressive dimension growth
Designs, Codes and Cryptography
Hi-index | 754.84 |
Let [n,k,d;q]-codes be linear codes of length n, dimension k, and minimum Hamming distance d over GF(q). In this correspondence, 18 codes are constructed which improve the known lower bounds on minimum distance