Sciweavers

4 search results - page 1 / 1
» A New Table of Constant Weight Codes of Length Greater than ...
Sort
View
COMBINATORICS
2006
105views more  COMBINATORICS 2006»
13 years 5 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
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
SIGMOD
2007
ACM
179views Database» more  SIGMOD 2007»
14 years 5 months ago
How to barter bits for chronons: compression and bandwidth trade offs for database scans
Two trends are converging to make the CPU cost of a table scan a more important component of database performance. First, table scans are becoming a larger fraction of the query p...
Allison L. Holloway, Vijayshankar Raman, Garret Sw...
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
13 years 11 months ago
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
Adam R. Day