Sciweavers

3373 search results - page 306 / 675
» Linear transformations on codes
Sort
View
JCT
2002
107views more  JCT 2002»
15 years 4 months ago
Asymmetric Binary Covering Codes
An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Qn such that every vector x Qn can be obtained from some vector c C by changing at most R...
Joshua N. Cooper, Robert B. Ellis, Andrew B. Kahng
VTC
2010
IEEE
172views Communications» more  VTC 2010»
15 years 2 months ago
Turbo Source Compression with Jointly Optimized Inner Irregular and Outer Irregular Codes
—In this paper, we present a near-lossless compression scheme for scalar-quantized source codec parameters based on iterative source-channel decoding (ISCD). The scheme is compar...
Laurent Schmalen, Peter Vary, Thorsten Clevorn, Ma...
CORR
2011
Springer
178views Education» more  CORR 2011»
14 years 11 months ago
Anytime Reliable Codes for Stabilizing Plants over Erasure Channels
—The problem of stabilizing an unstable plant over a noisy communication link is an increasingly important one that arises in problems of distributed control and networked contro...
Ravi Teja Sukhavasi, Babak Hassibi
CISS
2010
IEEE
14 years 8 months ago
The maximum stable broadcast throughput for wireless line networks with network coding and topology control
—We consider broadcasting from a single source to multiple destinations in a linear wireless erasure network with feedback. The problem is to find the maximum stable throughput ...
Ka-Hung Hui, Yalin Evren Sagduyu, Dongning Guo, Ra...
DCC
2003
IEEE
16 years 4 months ago
Optimal Alphabet Partitioning for Semi-Adaptive Coding of Sources of Unknown Sparse Distributions
Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers and encode each symbol by using some suitable prefix...
Dan Chen, Yi-Jen Chiang, Nasir D. Memon, Xiaolin W...