Publication venue Published by Elsevier B.V.
Publication date 31/10/1985
Field of study Get PDF AbstractIn this paper we give some lower and upper bounds for the smallest length n(k, d) of a binary linear code with dimension k and minimum distance d. The lower bounds improve the known ones for small d. In the last section we summarize what we know about n(8, d)
Publication venue Tilburg centre for Creative computing
Publication date 01/01/2011
Field of study Get PDF
Publication venue 'Institution of Engineering and Technology (IET)'
Publication date 01/01/1994
Field of study No full text
Publication venue 'Institute of Electrical and Electronics Engineers (IEEE)'
Publication date
Field of study No full text
Publication venue
Publication date 01/01/1993
Field of study No full text
Publication venue
Publication date 01/01/1992
Field of study No full text
Publication venue
Publication date 01/01/1992
Field of study No full text
Publication venue Tilburg centre for Creative computing
Publication date 01/01/2011
Field of study Get PDF
Publication venue 'Springer Science and Business Media LLC'
Publication date 01/01/2009
Field of study No full text