Sciweavers

2572 search results - page 62 / 515
» codes 2008
Sort
View
SIAMDM
2002
84views more  SIAMDM 2002»
14 years 10 months ago
Multicovering Bounds from Relative Covering Radii
The multicovering radii of a code are recently introduced natural generalizations of the covering radius measuring the smallest radius of balls around codewords that cover all m-t...
Iiro S. Honkala, Andrew Klapper
64
Voted
TIT
2008
86views more  TIT 2008»
14 years 11 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
2008
Springer
103views Education» more  CORR 2008»
14 years 11 months ago
A Class of Transformations that Polarize Symmetric Binary-Input Memoryless Channels
Abstract-- A generalization of Arikan's polar code construction using transformations of the form Gn where G is an
Satish Babu Korada, Eren Sasoglu
CORR
2008
Springer
94views Education» more  CORR 2008»
14 years 11 months ago
Robust Joint Source-Channel Coding for Delay-Limited Applications
In this paper, we consider the problem of robust joint source-channel coding over an additive white Gaussian noise channel. We propose a new scheme which achieves the optimal slope...
Mahmoud Taherzadeh, Amir K. Khandani
TIT
1998
73views more  TIT 1998»
14 years 10 months ago
Subspace Subcodes of Reed-Solomon Codes
— In this paper we introduce a class of nonlinear cyclic error-correcting codes, which we call subspace subcodes of Reed–Solomon (SSRS) codes. An SSRS code is a subset of a par...
Masayuki Hattori, Robert J. McEliece, Gustave Solo...