19 search results - page 1 / 4 » On binary 1-perfect additive codes: Some structural properti... |
TIT
2002
13 years 4 months ago
2002
DCC
2004
IEEE
14 years 4 months ago
2004
IEEE
We introduce three new innovations for compression using LDPCs for the Slepian-Wolf problem. The first is a general iterative Slepian-Wolf decoding algorithm that incorporates the...
TIT
2008
13 years 4 months ago
2008
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We derive a continuous probability distribution which generates neighbours of a point in an interval in a similar way to the bitwise mutation of a Gray code binary string...
WCC
2005
Springer
13 years 10 months ago
2005
Springer
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...