Sciweavers

114 search results - page 6 / 23
» Hardness of Approximating the Minimum Distance of a Linear C...
Sort
View
93
Voted
JMLR
2006
97views more  JMLR 2006»
15 years 9 days ago
Distance Patterns in Structural Similarity
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if bo...
Thomas Kämpke
CPM
2000
Springer
105views Combinatorics» more  CPM 2000»
15 years 4 months ago
Structural Properties and Tractability Results for Linear Synteny
The syntenic dista nce between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic dis...
David Liben-Nowell, Jon M. Kleinberg
84
Voted
ICISC
2007
120views Cryptology» more  ICISC 2007»
15 years 1 months ago
A Note About the Traceability Properties of Linear Codes
We characterize the traceability properties of linear codes. It is well known that any code of length n and minimum distance d is a c-TA code if c2 < n/(n−d). In this paper, w...
Marcel Fernandez, Josep Cotrina Navau, Miguel Sori...
112
Voted
DCC
2005
IEEE
15 years 12 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
104
Voted
COCOON
2005
Springer
15 years 5 months ago
Error-Set Codes and Related Objects
By considering a new metric, Nikov and Nikova defined the class of error-set correcting codes. These codes differ from the errorcorrecting codes in the sense that the minimum dis...
An Braeken, Ventzislav Nikov, Svetla Nikova