716 search results - page 19 / 144 » Algorithmic Issues in Coding Theory |
101
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
— 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...
155
click to vote
HASKELL
2009
ACM
15 years 8 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
118
click to vote
CORR
2004
Springer
15 years 2 months ago
2004
Springer
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...
122
Voted
ICIP
2009
IEEE
15 years 2 days ago
2009
IEEE
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...
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
A first-order-residual/second-order-residual (FOR/SOR) based video coding algorithm that incorporates the super macroblock (SMB) and the inter-frame stripe prediction (ISP) techn...