Bounds on mixed binary/ternary codes
Authors:
- A.E. BrouwerABA.E. Brouwer
- H.O. HamalainenHHH.O. Hamalainen
- P.R.J. OstergardPOP.R.J. Ostergard
- N.J.A. SloaneNSN.J.A. Sloane
- 1 January 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 44 (1) , 140-161
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- Graph domination, tabu search and the football pool problemDiscrete Applied Mathematics, 1997
- A New Table of Binary/Ternary Mixed Covering CodesDesigns, Codes and Cryptography, 1997
- Constructing covering codes by tabu searchJournal of Combinatorial Designs, 1997
- A linear programming bound for orthogonal arrays with mixed levelsJournal of Statistical Planning and Inference, 1996
- New single-error-correcting codesIEEE Transactions on Information Theory, 1996
- Football Pools--A Game for MathematiciansThe American Mathematical Monthly, 1995
- MacWilliams identities and coordinate partitionsLinear Algebra and its Applications, 1995
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent SetOperations Research, 1994
- Constructions for perfect mixed codes and other covering codesIEEE Transactions on Information Theory, 1993
- Tabu Search—Part IINFORMS Journal on Computing, 1989