Soft-decision decoding using punctured codes

@article{Dumer2001SoftdecisionDU,
  title={Soft-decision decoding using punctured codes},
  author={Ilya Dumer},
  journal={IEEE Trans. Information Theory},
  year={2001},
  volume={47},
  pages={59-71}
}
Let a -ary linear ( )-code be used over a memoryless channel. We design a soft-decision decoding algorithm that tries to locate a few most probable error patterns on a shorter length [ ]. First, we take cyclically consecutive positions starting from any initial point. Then we cut the subinterval of length into two parts and examine most plausible error patterns on either part. To obtain codewords of a punctured ( )-code, we try to match the syndromes of both parts. Finally, the designed… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-9 of 9 extracted citations

Modified Decoding Algorithm in CDMA System Under Fading Channel

2008 4th International Conference on Wireless Communications, Networking and Mobile Computing • 2008
View 3 Excerpts
Highly Influenced

BEAST decoding - asymptotic complexity

IEEE Information Theory Workshop, 2005. • 2005
View 3 Excerpts
Highly Influenced

BEAST decoding of block codes obtained via convolutional codes

IEEE Transactions on Information Theory • 2005
View 6 Excerpts
Highly Influenced

Numerical techniques for finding the distances of quantum codes

2014 IEEE International Symposium on Information Theory • 2014
View 1 Excerpt

Linked-cluster technique for finding the distance of a quantum LDPC code

2013 Information Theory and Applications Workshop (ITA) • 2013
View 1 Excerpt

Reliability-Based Soft-Decision Decoding With Multiple Biases

IEEE Transactions on Information Theory • 2007
View 1 Excerpt

Box and match techniques applied to soft-decision decoding

IEEE Transactions on Information Theory • 2004
View 1 Excerpt

References

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

Complexity Issues in Coding Theory

Electronic Colloquium on Computational Complexity • 1997
View 1 Excerpt

Suboptimal decoding of linear codes: partition technique

IEEE Trans. Information Theory • 1996
View 10 Excerpts

Be’ery, “Maximum-likelihood soft decoding of BCH codes,”IEEE

Y. A. Vardy
Trans. Inform. Theory , • 1994

Bounds on complexity of trellis decoding of linear codes” (in Russian)

V. V. Zyablov, V. R. Sidorenko
Probl. Pered. Inform. , vol. 29, no. 3, pp. 3–9 • 1993
View 1 Excerpt

Combinatorial-probabilistic and geometrical methods in threshold logic

Yu. A. Zuev
(in Russian), Discr. Math., • 1991
View 1 Excerpt

Blinovskii, “Lower asymptotic bound on the number of linear code words in a sphere of given radius in F

V M.
(in Russian),Probl. Pered. Inform., • 1987
View 1 Excerpt

Lower asymptotic bound on the number of linear code words in a sphere of given radius in F ” ( in Russian ) , Probl

V. M. Blinovskii
Pered . Inform . • 1987

Similar Papers

Loading similar papers…