The IP theorem, which asserts that IP = PSPACE (Lund et. al., and Shamir, in J. ACM 39(4)), is one of the major achievements of complexity theory. The known proofs of the theorem ...
It has been theoretically shown that performing coding in networked systems, including Reed-Solomon codes, fountain codes, and random network coding, has a clear advantage with re...
This paper presents a new spatio-temporal motion estimation algorithm for video coding. The algorithm is based on optimization theory and consists of the strategies including 3D s...
—An overview of the many practical applications of channel coding theory in the past 50 years is presented. The following application areas are included: deep space communication...
Daniel J. Costello Jr., Joachim Hagenauer, H. Imai...
Until recently, the theory of noncoherent communications was premised on the use of orthogonal multi-pulse modulation such as frequency shift keying. The main drawback of this modu...