%A David B. Jaffe
%T Optimal binary linear codes of length $\leq 30$
%R to appear in {\it Discrete Mathematics}
%Q access via "jaffe optimal binary 30"

%A David B. Jaffe
%T Binary linear codes: new results on nonexistence
%R preprint (ongoing work), Version 0.5 (11/10/97),
accessible over the World Wide Web via \\
{\tt http://www.math.unl.edu/\string~djaffe/codes/code.ps.gz}
or {\tt code.dvi.gz}; see \\
{\tt .../\string~djaffe/binary/codeform.html}
for an online database, which is more frequently updated
%Q access via "jaffe split guide"

%A A. E. Brouwer
%A Tom Verhoeff
%T An updated table of minimum-distance bounds for binary linear codes
%J |IEETI2|
%V 39
%D 1993
%P 662-677
%O supplemented by on-line updates: information regarding $[n,k,d]$ codes with
fixed $n,k$ is accessible over the World Wide Web via
{\tt http://www.win.tue.nl/~aeb/voorlincod.html}
%Q access via "brouwer verhoeff 1993"

\def\Tilborg{Tilborg, H. van}
%A Tor Helleseth
%A \Tilborg
%T A new class of codes meeting the Griesmer bound
%J |IEETI2|
%V 27
%D 1981
%P 548-555
%Q access via "helleseth tilborg griesmer 1981"
%X On CD-ROM.

%A Tor Helleseth
%T New constructions of codes meeting the Griesmer bound
%J |IEETI2|
%V 29
%D 1983
%P 434-439
%Q access via "helleseth new constructions 1983"

%A Iliya Bouyukliev
%A David B. Jaffe
%T Optimal binary linear codes of dimension at most seven
%R preprint
%Q access via "boukliev jaffe dimension seven"

%A Iliya Bouyukliev
%A David B. Jaffe
%A Vesselin Vavrek
%T The smallest length of eight-dimensional binary                        
linear codes with prescribed minimum distance
%R preprint
%Q access via "boukliev jaffe dimension eight"

%A Iliya Boukliev
%T Some binary linear codes with dimension $8$ constructed from subgroups of
$\F_{2^8}^*$
%B Proceedings of the Second International Workshop on Optimal Codes and
Related Topics (Sozopol, Bulgaria, June 9-15, 1998)
%I Institute of Mathematics and Informatics
%C Sofia
%D 1998
%P 28-32
%Q access via "boukliev sozopol 1998"

%A J. H. Griesmer
%T A bound for error-correcting codes
%J IBM J. Res. Develop.
%V 4
%D 1960
%P 532-542
%Q access via "griesmer 1960"

%A S. Topalova
%T Construction and investigation of combinatorial designs with given 
automorphisms
%o PhD Thesis
%I Institute of Mathematics and Informatics, Bulgarian Academy of Sciences
%D 1998
%Q access via "topalova thesis"
%X I don't have this.

\def\Eupen{van Eupen}
%A A. E. Brouwer
%A M. \Eupen
%T The correspondence between projective codes and $2$-weight codes
%J Designs, Codes, and Cryptography
%V 11
%D 1997
%P 261-266
%Q access via "brouwer van eupen 1997"

%A A. E. Brouwer
%A A. M. Cohen
%A A. Neumaier
%T Distance-regular graphs
%I |SPRINGER|
%D 1989
%Q access via "brouwer cohen neumaier 1989"
%X I don't have this.

%A E. M. Rains
%A N. J. A. Sloane
%T Self-dual codes
%B Handbook of Coding Theory
%E V. S. Pless
%E W. C. Huffman
%I Elsevier Science
%D 1998
%Q access via "rains sloane handbook"

%A David B. Jaffe
%T A brief tour of split linear programming (Proc.\ AAECC 12, ed.\ T.\ Mora,
H.\ Mattson)
%S Lecture Notes in Computer Science
%I |SPRINGER|
%V 1255
%D 1997
%P 164-173
%Q access via "brief tour split main"

%A S. M. Dodunekov
%T The minimum block length of a linear $q$-ary code with given dimension and 
code distance (in Russian)
%J Problemy Peredachi Informatsii 
%V 20 
%D 1984
%P 11-22
%Q access via "dodunekov block 1984"
%X I don't have this.

%A S. M. Dodunekov
%A N. L. Manev
%T Characterization of two classes of codes that attain the Griesmer bound
%J |PROIT2|
%V 19
%D 1983
%P 253-259
%Q access via "dodunekov manev characterization 1983"
%X I don't have this.

%A R. Hill
%T Caps and codes
%J |DISCM|
%V 22
%D 1978
%P 111-137
%Q access via "hill caps codes"
%X I don't have this.

%A Brendan D. McKay
%T Practical graph isomorphism
%J |CONGN|
%V 30
%D 1981
%P 45-87
%Q access via "practical graph isomorphism"

%A Brendan D. McKay
%T Nauty User's Guide (Version 1.5)
%D 1990.  This guide as well as the nauty source files are available over the
World Wide Web via \\
{\tt http://cs.anu.edu.au/people/bdm/nauty19/nauty19p.tar.Z}
%Q access via "nauty guide onepointfive"

%A Yasuo Sugiyama
%A Masao Kasahara
%A Shigeichi Hirasawa
%A Toshihiko Namekawa
%T Further results on Goppa codes and their applications to constructing
efficient binary codes
%J |IEETI2|
%V 22
%D 1976
%P 518-526
%Q access via "sugiyama 1976"

%A T. Helleseth
%T Further classifications of codes meeting the Griesmer bound
%J |IEETI2|
%V 30 
%D 1984
%P 395-403
%Q access via "helleseth further Griesmer"

%A S. M. Dodunekov
%T Optimal linear codes
%o PhD thesis
%I Institute of Mathematics and Informatics, Bulgarian Academy of Sciences
%D 1985
%Q access via "dodunekov linear thesis"

%A L. D. Baumert
%A R. J. McEliece
%T A note on the Griesmer bound
%J |IEETI2|
%V 19
%D 1973
%P 134-135
%Q access via "baumert mceliece"
%X I don't have this and haven't seen it.

\def\BelovLogacevSandimirov{Belov, B. I., V. N. Loga\v cev, V. P. Sandimirov}
%A \BelovLogacevSandimirov
%T Construction of a class of linear binary codes achieving the
Var\v samov-Griesmer bound
%J Problemy Pereda\v ci Informacii
%V 10
%D 1974
%P 36-44
%Q access via "belov logacev sandimirov"
%X I don't have this and haven't seen it.

%A B. I. Belov
%T A conjecture on the Griesmer boundary
%B Optimization methods and their applications (All-Union Summer Sem.,
Khakusy, Lake Baikal, 1972)(Russian)
%P 100-106, 182
%I Sibersk. \`Energet. Inst. Sibirsk. Otdel. Akad. Nauk SSSR
%C Irkutsk
%D 1974
%Q access via "belov griesmer baikal"
%X I don't have this and haven't seen it.

%A S. M. Dodunekov
%A N. L. Manev
%T An improvement of the Griesmer bound for some classes of distances
%J |PROIT2|
%D 1987
%V 23
%P 38-46
%Q access via "dodunekov manev proit 1987"
%X I don't have this and haven't seen it.

%A N. J. A. Sloane
%A S. M. Reddy
%A C. L. Chen
%T New binary codes
%J |IEETI2|
%V 18
%P 503-510
%D 1972
%Q access via "sloane reddy chen"
%X I don't have this and haven't seen it.

%A C. L. Chen
%T Computer results on the minimum distance of some binary cyclic codes
%J |IEETI2|
%V 16
%D 1970
%P 359-360
%Q access via "chen computer results"

%A G. Solomon
%A J. J. Stiffler
%T Algebraically punctured cyclic codes
%J |INFOC2|
%V 8
%D 1965
%P 170-179
%Q access via "solomon stiffler"
%X I don't have this and haven't seen it.

%A Tor Helleseth
%T Projective codes meeting the Griesmer bound
%J |DISCM|
%V 106/107
%D 1992
%P 265-271
%Q access via "helleseth projective codes"

%A Tor Helleseth
%T A characterization of codes meeting the Griesmer bound
%J |INFOC2|
%V 50
%D 1981
%P 128-159
%Q access via "helleseth characterization 1981"

\def\AssmusPless{Assmus, E. F., Jr. and V. Pless}
%A \AssmusPless
%T On the covering radius of extremal self-dual codes
%J |IEETI2|
%V 29
%D 1983
%P 359-363
%Q access via "assmus pless covering radius"
%X I don't have this.

%A N. Manev
%T On the uniqueness of certain codes meeting the Griesmer bound
%J |PLISM2|
%V 8
%D 1986
%P 47-53
%Q access via "manev pliska"
%X I don't have this and haven't seen it.

%A C. L. Mallows
%A N. J. A. Sloane
%T An upper bound for self-dual codes
%J |INFOC2|
%V 22
%D 1973
%P 188-200
%Q access via "mallows sloane upper bound"

%A F. Jessie MacWilliams
%A Colin L. Mallows
%A Neil J. A. Sloane
%T Generalizations of Gleason's theorem on weight enumerators of self-dual codes
%J |IEETI2|
%V 18
%D 1972
%P 794-805
%Q access via "macwilliams mallows sloane"

%A Joe Fields
%A Vera Pless
%T Split weight enumerators of extremal self-dual codes
%R preprint
%Q access via "fields pless split"

%A J. H. Conway
%A Vera Pless
%T On primes dividing the group order of a doubly-even
$(72,36,16)$ code and the group order of a quaternary $(24,12,10)$ code
%J |DISCM|
%V 38
%D 1982
%P 143-156
%Q access via "conway pless prime"
%X I don't have this.

%A Vera Pless
%A John G. Thompson
%T $17$ does not divide the order of the group of a
$(72,36,16)$ doubly even code
%J |IEETI2|
%V 28
%D 1982
%P 537-541
%Q access via "pless thompson 17"
%X I don't have this.

%A Vera Pless
%T $23$ does not divide the order of the group of a
$(72,36,16)$ doubly even code
%J |IEETI2|
%V 28
%D 1982
%P 113-117
%Q access via "pless divide 23"
%X I don't have this.

%A W. Cary Huffman
%A V. Y. Yorgov
%T A $[72,36,16]$ doubly even code does not have an automorphism of
order $11$
%J |IEETI2|
%V 33
%D 1987
%P 749-752
%X access via "huffman yorgov"

%A N. J. A. Sloane
%T Is there a $(72,36)$ $d = 16$ self-dual code?
%J |IEETI2|
%V 19
%D 1973
%P 251
%X access via "sloane 72 36 question"

%A F. J. MacWilliams
%T Review of ``Is there a $(72,36)$ $d = 16$ self-dual code?''
%J Mathematical Reviews
%V 54 \#9843
%X access via "macwilliams cash prize"

%A Stoyan N. Kapralov
%T Enumeration of the binary linear $[24,7,10]$ codes
%B Proceedings of the Fifth International Workshop on Algebraic and
Combinatorial Coding Theory
%I Unicorn
%C Shumen, Bulgaria
%D 1996
%P 151-156
%X access via "kapralov fifth enumeration"

%A E. L. Blokh
%A V. V. Zyablov
%T Coding of generalized concatenated codes
%J |PROIT2|
%V 10
%D 1974
%P 218-222
%Q access via "blokh zyablov"
%X I don't have this and haven't seen it.

%A J. Bierbrauer
%A Y. Edel
%T Twisted BCH codes
%J J. of Combinatorial Designs
%V 5
%D 1997
%P 377-389
%Q access via "bierbrauer edel twisted 1997"
%X I don't have this.

%A T. A. Gulliver
%A V. K. Bhargava
%T Nine good rate $(m-1)/pm$ quasi-cyclic codes
%J |IEETI2|
%V 38
%D 1991
%P 1366-1369
%Q access via "nine good rate codes"
%X I don't have this.

%A T. A. Gulliver
%A V. K. Bhargava
%T Improvements to the bounds on optimal binary linear codes of dimensions
$11$ and $12$
%J |ARSCO2|
%V 44
%D 1996
%P 173-181
%Q access via "gulliver bhargava improvements 1996"
%X I don't have this.

%A T. A. Gulliver
%A V. K. Bhargava
%T Two new rate $2/p$ binary quasi-cyclic codes
%J |IEETI2|
%V 1994
%P 1667-1668
%Q access via "two new rate 1994"
%X I don't have this.

%A T. A. Gulliver
%A V. K. Bhargava
%T Some best rate $1/p$ and rate $(p-1)/p$ systematic quasi-cyclic codes
%J |IEETI2|
%V 37
%D 1991
%P 552-555
%Q access via "some best rate 1991"
%X I don't have this.

%A J. Bierbrauer
%A Y. Edel
%T New code parameters from Reed-Solomon subfield codes
%J |IEETI2|
%V 43
%D 1997
%P 953-968
%Q access via "bierbrauer edel reed solomon"

%A J. Bierbrauer
%A Y. Edel
%T Some codes relating to BCH-codes of low dimension
%Q access via "bierbrauer edel some low codes"

%A Y. Cheng
%T New linear codes constructed by concatenating, extending, and shortening
methods
%J |IEETI2|
%V 33
%D 1987
%P 719-721
%Q access via "cheng new linear codes"
%X I don't have this and haven't seen it.

%A R. Dougherty
%A H. Janwa
%T Covering radius computations for binary cyclic codes
%J |MATHC3|
%V 57
%D 1991
%P 415-434
%Q access via "dougherty janwa radius"
%X I don't have this.

%A B. Groneick
%A S. Grosse
%T New binary codes
%J |IEETI2|
%V 40
%D 1994
%P 510-512
%Q access via "groneick grosse"
%X I don't have this and haven't seen it.

%A T. Kasami
%A N. Tokura
%T Some remarks on BCH bounds and minimum weights of binary primitive BCH codes
%J |IEETI2|
%V 15
%P 408-413
%D 1969
%Q access via "kasami tokura"
%X I don't have this and haven't seen it.

%A I. Boukliev
%A S. M. Dodunekov
%A T. Helleseth
%A \/Oyvind Ytrehus
%T On the $[162,8,80]$ codes
%J |IEETI2|
%V 43
%D 1997
%P 2055-2057
%Q access via "boukliev dodunekov helleseth ytrehus"
%X On CD-ROM.

%A S. M. Dodunekov
%A T. Helleseth
%A N. Manev
%A \Oyvind Ytrehus
%T New bounds on binary linear codes of dimension eight
%J |IEETI2|
%V 33
%D 1987
%P 917-919
%Q access via "dodunekov ytrehus 1987"

%A S. M. Dodunekov
%A N. L. Manev
%T An improvement of the Griesmer bound for some small minimum distances
%J |DISAM|
%V 12
%D 1985
%P 103-114
%Q access via "dodunekov manev 1985"
%X I don't have this.

\def\BruhlFarkas{Br\"uhl, K. and P. Farka\v s}
%A \BruhlFarkas
%T Three best binary linear block codes of minimum distance fifteen
%J |IEETI2|
%J |IEETI2|
%V 40
%D 1994
%P 949-951
%Q access via "farkas bruhl"
%X I don't have this and haven't seen it.

%A T. A. Gulliver
%A V. K. Bhargava
%T New optimal binary linear codes of dimensions $9$ and $10$
%J |IEETI2|
%V 43
%D 1997
%P 314-316
%Q access via "gulliver bhargava 1997"
%X In issue of IEEE Trans. which I own.

%A P. Piret
%T Good block codes derived from cyclic codes
%J Electronics Letters
%V 10
%P 391-392
%D 1974
%Q access via "piret good block codes"

%A Amir Said
%A Reginaldo Palazzo
%T Using combinatorial optimization to design good unit-memory convolutional 
codes
%J |IEETI2|
%V 39
%D 1993
%P 1100-1108
%Q access via "said palazzo"

\def\Pul{van Pul, C. L. M.}
%A \Pul
%T On bounds on codes
%R Master's Thesis, Dept. of Math. and Comp. Sc., Eindhoven Univ. of Techn.,
The Netherlands
%D 1982
%Q access via "van Pul thesis"
%X I don't have this and haven't seen it.

\def\Tilborg{Tilborg, H. van}
%A \Tilborg
%T On quasi-cyclic codes with rate $1/m$
%J |IEETI2|
%V 24
%D 1978
%P 628-630
%Q access via "tilborg quasi-cyclic"
%X I don't have this and haven't seen it.

\def\Tilborg{Tilborg, H. van}
%A \Tilborg
%T The smallest length of binary $7$-dimensional linear codes with
prescribed minimum distance
%J |DISCM|
%V 33
%D 1981
%P 197-207
%Q access via "tilborg 1981 discrete"
%X I don't have this.

%A A. A. Hashim
%A V. S. Pozdniakov
%T Computerized search for linear binary codes
%J Electronics Letters
%V 12
%D 1976
%P 350-351
%Q access via "hashim pozdniakov"
%X I don't have this and haven't seen it.

%A T. J. Wagner
%T A remark concerning the minimum distance of binary group codes
%J |IEETI2|
%V 11
%D 1965
%P 458
%Q access via "wagner group codes"
%X I don't have this and haven't seen it.

%A P. Piret
%T Good linear codes of lengths $27$ and $28$
%J |IEETI2|
%V 26
%D 1980
%P 227
%Q access via "piret 1980"
%X I don't have this and haven't seen it.

%A M. Karlin
%T New binary coding results by circulants
%J |IEETI2|
%V 15
%D 1969
%P 81-92
%Q access via "karlin circulants"
%X I don't have this and I haven't seen it.

%A Ying Cheng
%A N. J. A. Sloane
%T Codes from symmetry groups, and a $[32,17,8]$ code
%J SIAM J.\ Disc.\ Math.
%V 2
%D 1989
%P 28-37
%Q access via "cheng sloane"

%A David B. Jaffe
%A Juriaan Simonis
%T New binary linear codes which are dual transforms of good codes
%R to appear in {\it IEEE Transactions on Information Theory}
%Q access via "jaffe simonis dual transform"

%A Victor Shoup
%T NTL: A library for doing number theory
%R accessible over the World Wide Web via
{\tt http://www.cs.wisc.edu/~shoup/ntl/ntl-2.0.tar.gz}
%Q access via "shoup ntl"

%A Juriaan Simonis
%T Codes and semilinear spaces
%B Combinatorics '90
%R ed.\ A. Barlotti et al.
%I North-Holland
%D 1992
%Q access via "simonis semilinear"

%A Juriaan Simonis
%T The $[23,14,5]$ Wagner code is unique
%R to appear in {\it Discrete Mathematics}
%Q access via "simonis wagner unique"
	
%A Juriaan Simonis
%T The $[18,9,6]$ code is unique
%J |DISCM|
%V 106/107
%D 1992
%P 439-448
%Q access via "simonis 1896 unique"
%X I don't have this.

%A Juriaan Simonis
%T A description of the $[16,7,6]$ codes
%J Lecture Notes in Computer Science
%V 508
%P Springer-Verlag
%P 24-35
%D 1991
%Q access via "simonis 1676 description"

%A Juriaan Simonis
%T Binary even $[25,15,6]$ codes do not exist
%J |IEETI2|
%V 33
%D 1987
%P 151-153
%Q access via "simonis 1987 25_15-6"

%A M. J. E. Golay
%T Notes on digital coding
%J Proc. IEEE
%V 37
%D 1949
%P 657
%Q access via "golay digital coding"
%X I don't have this and haven't seen it.

%A S. M. Dodunekov
%A S. B. Encheva
%T Uniqueness of some linear subcodes of the extended binary Golay code
%J |PROIT2|
%V 29
%D 1993
%P 38-43
%Q access via "golay subcodes 1993"

%A S. M. Dodunekov
%A S. B. Encheva
%T On the uniqueness of some linear subcodes of the binary extended Golay code
%B Proc.\ International Workshop on Algebraic and Combinatorial Coding Theory
%C Varna, Bulgaria
%D 1988
%P 38-40
%Q access via "golay subcodes 1988"
%X I don't have this.

%A B. K. Kostova
%A N. L. Manev
%T A $[25,8,10]$ code does not exist
%J |CRACA|
%V 43
%D 1990
%P 41-44
%Q access via "kostova manev"
%X I don't have this.

%A Sylvia Borissova Encheva
%T Optimal binary linear codes
%J Reports in Informatics (University of Bergen)
%V 63
%D 1992
%Q access via "encheva 1992 report"

%A S. L. Snover
%T The Uniqueness of the Nordstrom-Robinson and the Golay Binary Codes
%o PhD Thesis
%I Michigan State Univ.
%D 1973
%Q access via "snover"
%X I haven't seen this.

%A A. E. Brouwer
%T The uniqueness of the binary linear $[27,7,12]$ code
%R accessible over the World Wide Web via
{\tt http://www.win.tue.nl/\string~aeb/preprints/Unique.27.7.12.gz}
%D 1992
%Q access via "brouwer 27 7 12 preprint"

%A Tor Helleseth
%A \Oyvind Ytrehus
%T How to find a $[33,8,14]$ code
%J Reports in Informatics (University of Bergen)
%V 41
%D 1989
%Q access via "helleseth ytrehus 33_8_14"

%A \Oyvind Ytrehus
%A Tor Helleseth
%T There is no binary $[25,8,10]$ code
%J |IEETI2|
%V 36
%D 1990
%P 695-696
%Q access via "ytrehus helleseth 1990"

%A P. W. Heijnen
%T Er bestaat geen binaire $[33,9,13]$ code
%R Afstudeerverslag, T. U. Delft
%D 1993
%Q access via "heijnen"
%X I have a version of this without the figures.

\def\Tilborg{Tilborg, H. van}
%A \Tilborg
%T On the uniqueness resp.\ nonexistence of certain codes meeting
the Griesmer bound
%J |INFOC2|
%V 44
%D 1980
%P 16-35
%Q access via "tilborg griesmer 1980"

%A F. J. MacWilliams
%A N. J. A. Sloane
%T The Theory of Error-Correcting Codes
%I North-Holland
%C Amsterdam
%D 1977
%Q access via "macwilliams sloane book"