Reliable Communication over Non-Binary Insertion/Deletion Channels

@article{Yazdani2012ReliableCO,
  title={Reliable Communication over Non-Binary Insertion/Deletion Channels},
  author={Raman Yazdani and Masoud Ardakani},
  journal={IEEE Transactions on Communications},
  year={2012},
  volume={60},
  pages={3597-3608}
}
We consider the problem of reliable communication over non-binary insertion/deletion channels where symbols are randomly deleted from or inserted in the received sequence and all symbols are corrupted by additive white Gaussian noise. To this end, we utilize the inherent redundancy achievable in non-binary symbol sets by first expanding the symbol set and then allocating part of the bits associated with each symbol to watermark symbols. The watermark sequence, known at the receiver, is then… CONTINUE READING
4 Citations
41 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 41 references

Bounds for deletion/insertion correcting codes

  • V. Levenshtein
  • Proc. 2002 IEEE Int. Symp. Inf. Theory, p. 370.
  • 2002
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…