412 search results - page 19 / 83 » New Set of Codes for the Maximum-Likelihood Decoding Problem |
59
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all cod...
ITSL
2008
14 years 11 months ago
2008
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
79
Voted
BMCBI
2010
14 years 9 months ago
2010
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
DCOSS
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Wireless sensor networks come of age and start moving out of the laboratory into the field. As the number of deployments is increasing the need for an efficient and relia...
75
Voted
TIT
2008
14 years 9 months ago
2008
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...