Sciweavers

TIT
1998
79views more  TIT 1998»
13 years 4 months ago
Greedy and Heuristic Algorithms for Codes and Colorings
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
Tuvi Etzion, Patric R. J. Östergård
COMBINATORICS
2007
59views more  COMBINATORICS 2007»
13 years 4 months ago
New Optimal Constant Weight Codes
In 2006, Smith et al. published a new table of constant weight codes, updating existing tables originally created by Brouwer et al. This paper improves upon these results by fill...
Igor Gashkov, D. Taub
COMBINATORICS
2006
105views more  COMBINATORICS 2006»
13 years 4 months ago
A New Table of Constant Weight Codes of Length Greater than 28
Existing tables of constant weight codes are mainly confined to codes of length n 28. This paper presents tables of codes of lengths 29 n 63. The motivation for creating these ...
Derek H. Smith, L. A. Hughes, Stephanie Perkins