23,439 research outputs found
Random Linear Fountain Code with Improved Decoding Success Probability
In this paper we study the problem of increasing the decoding success
probability of random linear fountain code over GF(2) for small packet lengths
used in delay-intolerant applications such as multimedia streaming. Such code
over GF(2) are attractive as they have lower decoding complexity than codes
over larger field size, but suffer from high transmission redundancy. In our
proposed coding scheme we construct a codeword which is not a linear
combination of any codewords previously transmitted to mitigate such
transmission redundancy. We then note the observation that the probability of
receiving a linearly dependent codeword is highest when the receiver has
received k-1 linearly independent codewords. We propose using the BlockACK
frame so that the codeword received after k-1 linearly independent codeword is
always linearly independent, this reduces the expected redundancy by a factor
of three.Comment: This paper appears in: Communications (APCC), 2016 22nd Asia-Pacific
Conference o
Improving success probability and embedding efficiency in code based steganography
For stegoschemes arising from error correcting codes, embedding depends on a
decoding map for the corresponding code. As decoding maps are usually not
complete, embedding can fail. We propose a method to ensure or increase the
probability of embedding success for these stegoschemes. This method is based
on puncturing codes. We show how the use of punctured codes may also increase
the embedding efficiency of the obtained stegoschemes
- …