49 research outputs found
On Coset Leader Graphs of LDPC Codes
Our main technical result is that, in the coset leader graph of a linear
binary code of block length n, the metric balls spanned by constant-weight
vectors grow exponentially slower than those in .
Following the approach of Friedman and Tillich (2006), we use this fact to
improve on the first linear programming bound on the rate of LDPC codes, as the
function of their minimal distance. This improvement, combined with the
techniques of Ben-Haim and Lytsin (2006), improves the rate vs distance bounds
for LDPC codes in a significant sub-range of relative distances
Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
Locally recoverable (LRC) codes have recently been a focus point of research
in coding theory due to their theoretical appeal and applications in
distributed storage systems. In an LRC code, any erased symbol of a codeword
can be recovered by accessing only a small number of other symbols. For LRC
codes over a small alphabet (such as binary), the optimal rate-distance
trade-off is unknown. We present several new combinatorial bounds on LRC codes
including the locality-aware sphere packing and Plotkin bounds. We also develop
an approach to linear programming (LP) bounds on LRC codes. The resulting LP
bound gives better estimates in examples than the other upper bounds known in
the literature. Further, we provide the tightest known upper bound on the rate
of linear LRC codes with a given relative distance, an improvement over the
previous best known bounds.Comment: To appear in IEEE Transactions on Information Theor
Low-Complexity Approaches to SlepianâWolf Near-Lossless Distributed Data Compression
This paper discusses the SlepianâWolf problem of distributed near-lossless compression of correlated sources. We introduce practical new tools for communicating at all rates in the achievable region. The technique employs a simple âsource-splittingâ strategy that does not require common sources of randomness at the encoders and decoders. This approach allows for pipelined encoding and decoding so that the system operates with the complexity of a single user encoder and decoder. Moreover, when this splitting approach is used in conjunction with iterative decoding methods, it produces a significant simplification of the decoding process. We demonstrate this approach for synthetically generated data. Finally, we consider the SlepianâWolf problem when linear codes are used as syndrome-formers and consider a linear programming relaxation to maximum-likelihood (ML) sequence decoding. We note that the fractional vertices of the relaxed polytope compete with the optimal solution in a manner analogous to that observed when the âmin-sumâ iterative decoding algorithm is applied. This relaxation exhibits the ML-certificate property: if an integral solution is found, it is the ML solution. For symmetric binary joint distributions, we show that selecting easily constructable âexpanderâ-style low-density parity check codes (LDPCs) as syndrome-formers admits a positive error exponent and therefore provably good performance
Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels
This paper describes an efficient implementation of binning for the relay
channel using low-density parity-check (LDPC) codes. We devise bilayer LDPC
codes to approach the theoretically promised rate of the decode-and-forward
relaying strategy by incorporating relay-generated information bits in
specially designed bilayer graphical code structures. While conventional LDPC
codes are sensitively tuned to operate efficiently at a certain channel
parameter, the proposed bilayer LDPC codes are capable of working at two
different channel parameters and two different rates: that at the relay and at
the destination. To analyze the performance of bilayer LDPC codes, bilayer
density evolution is devised as an extension of the standard density evolution
algorithm. Based on bilayer density evolution, a design methodology is
developed for the bilayer codes in which the degree distribution is iteratively
improved using linear programming. Further, in order to approach the
theoretical decode-and-forward rate for a wide range of channel parameters,
this paper proposes two different forms bilayer codes, the bilayer-expurgated
and bilayer-lengthened codes. It is demonstrated that a properly designed
bilayer LDPC code can achieve an asymptotic infinite-length threshold within
0.24 dB gap to the Shannon limits of two different channels simultaneously for
a wide range of channel parameters. By practical code construction,
finite-length bilayer codes are shown to be able to approach within a 0.6 dB
gap to the theoretical decode-and-forward rate of the relay channel at a block
length of and a bit-error probability (BER) of . Finally, it is
demonstrated that a generalized version of the proposed bilayer code
construction is applicable to relay networks with multiple relays.Comment: Submitted to IEEE Trans. Info. Theor
Repeat-Accumulateæ§é ă«ćșă„ăçŽćéŁæ„俥ć·çŹŠć·
é»æ°é俥性ćŠ201