Techniques of bounding the probability of decoding error for block coded modulation structures

DOI10.1109/18.335901zbMath0821.94011OpenAlexW2083233139MaRDI QIDQ4838644

Gregory Poltyrev, Hanan Herzberg

Publication date: 25 September 1995

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7123f1c64a35dbd6bc73fc43be435abead92a255

zbMATH Keywords

Leech latticecoded modulationunion boundAWGN channelmemoryless channelminimum distance boundcoset codingprobability of decoding errorspectrum of distances

Mathematics Subject Classification ID

Combined modulation schemes (including trellis codes) in coding theory (94B12) Lattice packing and covering (number-theoretic aspects) (11H31) Modulation and demodulation in information and communication theory (94A14)

Related Items (3)

An upper bound on error probability in communication systems with single-user reception based on order statistics ⋮ The parameterized Gallager's first bounds based on conditional triplet-wise error probability ⋮ Upper bound on the bit error probability of systematic binary linear codes via their weight spectra

This page was built for publication: Techniques of bounding the probability of decoding error for block coded modulation structures