7189 search results - page 261 / 1438 » Connecting Design with Code |
130
click to vote
ISCAS
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— We analyze the decoding algorithm for regular timeinvariant LDPC convolutional codes as a 3D signal processing scheme and derive several parallelization concepts, which...
113
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field ac...
155
click to vote
DAM
2010
15 years 3 months ago
2010
Codes of length n2 and dimension 2n - 1 or 2n - 2 over the field Fp, for any prime p, that can be obtained from designs associated with the complete bipartite graph Kn,n and its l...
103
click to vote
JCO
2007
15 years 3 months ago
2007
This paper discusses the relation among four problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. We prove a surprising equivalence relat...
134
click to vote
JSC
2010
15 years 2 months ago
2010
We examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. the Hamming graph H(n, 2). We find the automorphism groups and the parameters of the cod...