Sciweavers

1005 search results - page 51 / 201
» On genomic coding theory
Sort
View
CORR
2007
Springer
110views Education» more  CORR 2007»
13 years 7 months ago
On formulas for decoding binary cyclic codes
— We address the problem of the algebraic decoding of any cyclic code up to the true minimum distance. For this, we use the classical formulation of the problem, which is to fin...
Daniel Augot, Magali Bardet, Jean-Charles Faug&egr...
TIT
2008
86views more  TIT 2008»
13 years 7 months ago
A One-to-One Code and Its Anti-Redundancy
One-to-one codes are "one shot" codes that assign a distinct codeword to source symbols and are not necessarily prefix codes (more generally, uniquely decodable). For ex...
Wojciech Szpankowski
CORR
2004
Springer
111views Education» more  CORR 2004»
13 years 7 months ago
Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard
Maximum-likelihood decoding is one of the central algorithmic problems in coding theory. It has been known for over 25 years that maximum-likelihood decoding of general linear cod...
Venkatesan Guruswami, Alexander Vardy
ICIP
2009
IEEE
13 years 5 months ago
Model based analysis for quantization parameter cascading in hierarchical video coding
Originally, the hierarchical coding structure was proposed to achieve temporal scalability. Soon after, it was realized that with a proper quantization parameter cascading (QPC) s...
Xiang Li, Peter Amon, Andreas Hutter, André...
BMCBI
2007
107views more  BMCBI 2007»
13 years 7 months ago
antiCODE: a natural sense-antisense transcripts database
Background: Natural antisense transcripts (NATs) are endogenous RNA molecules that exhibit partial or complete complementarity to other RNAs, and that may contribute to the regula...
Yifei Yin, Yi Zhao, Jie Wang, Changning Liu, Shugu...