22 search results - page 1 / 5 » Asymmetric Binary Covering Codes |
JCT
2002
13 years 6 months ago
2002
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...
TIT
2008
13 years 6 months ago
2008
We introduce and study error correcting codes for parallel synchronous communication via asymmetric channels. Constructions for error detecting/correcting codes are presented. Mor...
DCC
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract—In this paper, an asymmetric Slepian-Wolf coding (SWC) scheme for binary finite memory source (FMS) is proposed. The a priori information about the source is extracted ...
ICASSP
2009
IEEE
14 years 1 months ago
2009
IEEE
We consider the distributed compression of two (binary memoryless) correlated sources and propose a unique codec that can reach any point in the Slepian-Wolf region. In a previous...
CORR
2007
Springer
13 years 6 months ago
2007
Springer
Distributed source coding schemes are typically based on the use of channels codes as source codes. In this paper we propose a new paradigm, termed “distributed arithmetic codin...