In order to obtain lower and upper bounds on the maximum possible
minimum distance of a q-ary linear code with word length n and
dimension k, where q is one of 2, 3 and 4, and 1 < k < n, and
n is not too large (e.g., n < 256 in the binary case and n < 130
in the ternary and quaternary cases), send email to
        aeb@cwi.nl
with a subject line (in the header)
        Subject: exec lincodbd
followed by a body consisting of zero or more lines of the form
	lincodbd q n k
(or just
	lincodbd n k
in the binary case).
An example:

% mail aeb@cwi.nl
Subject: exec lincodbd
lincodbd 55 7
lincodbd 3 15 8
lincodbd 3 69 5
lincodbd 4 78 6
.
EOT
% sleep 5
% mail
"/usr/spool/mail/aeb": 25 messages 1 new 2 unread
>N 25 aeb's.daemon@cwi.nl   Fri Sep 10 19:20  47/1186 "Re: exec lincodbd"
---t
From aeb@cwi.nl Fri Sep 10 19:20:11 1993
Subject: Re: exec lincodbd
Reply-To: Andries.Brouwer@cwi.nl
Delivered-By: aebmail

Dear aeb@win.tue.nl (A.E. Brouwer),
My programs, when called with your input
        lincodbd 55 7
        lincodbd 3 15 8
        lincodbd 3 69 5
        lincodbd 4 78 6
produce the output given below.
Best regards,
Andries Brouwer - aeb@cwi.nl


Lb(55,7) = 25 Zv 

Ub(55,7) = 25 vT4
---
Lb(15,8) = 5 is found by shortening of:
Lb(27,20) = 5 is found by truncation of:
Lb(28,20) = 6 KP 

Ub(15,8) = 5 vE 
---
Lb(69,5) = 45 vEH

Ub(69,5) = 45 follows by the Griesmer bound.
---
Lb(78,6) = 56 Hi 

Ub(78,6) = 56 follows by the Griesmer bound.
---
Now also tables for q=3,4. Call is: lincodbd q n k
Last update q=2: Tue Sep  7 17:37:02 MDT 1993
Last update q=3: Tue Aug 24 14:52:45 MDT 1993
Last update q=4: Sat Aug 21 02:37:07 MDT 1993

---