Sciweavers

24 search results - page 4 / 5
» Ternary Constant Weight Codes
Sort
View
TIT
1998
79views more  TIT 1998»
13 years 6 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
ECCC
2011
204views ECommerce» more  ECCC 2011»
12 years 10 months ago
Dense locally testable codes cannot have constant rate and distance
A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important questi...
Irit Dinur, Tali Kaufman
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 6 months ago
Bounds on Codes Based on Graph Theory
"THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD" Let Aq(n, d) be the maximum order (maximum number of codewords) of a q-ary code of length n and Hamming distance at l...
Salim Y. El Rouayheb, Costas N. Georghiades, Emina...
BMCBI
2007
265views more  BMCBI 2007»
13 years 6 months ago
Large scale clustering of protein sequences with FORCE -A layout based heuristic for weighted cluster editing
Background: Detecting groups of functionally related proteins from their amino acid sequence alone has been a long-standing challenge in computational genome research. Several clu...
Tobias Wittkop, Jan Baumbach, Francisco P. Lobo, S...
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 6 months ago
Construction and Applications of CRT Sequences
Protocol sequences are used for channel access in the collision channel without feedback. Each user accesses the channel according to a deterministic zero-one pattern, called the p...
Kenneth W. Shum, Wing Shing Wong