𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On metrics matched to the discrete memoryless channel

✍ Scribed by Gérald Séguin

Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
604 KB
Volume
309
Category
Article
ISSN
0016-0032

No coin nor oath required. For personal study only.

✦ Synopsis

A sequence of metrics {D,.,} is said to be additive and matched to a discrete memoryless channel (DMC) if DN is the sum on its coordinates of N single letter metrics and if the maximum likelihood decoder for sequences of length N is a minimum D,-distance decoder. Necessary and sufficient conditions on the transition probabilities of a DMC for the existence of a sequence of additive metrics matched to it are given. In the case of the binary channel these are shown to be equivalent to the channel being symmetric. Explicit transition probabilities are given for a large class of ternary

DMCs with an associated sequence of additive matched metrics. The problem solved here may be considered a generalization of the problem of finding the DMCs matched to the Lee metric solved by Chiang and Wolf in 1971 (2).

📜 SIMILAR VOLUMES

Efficient Communication Over the Discret
Efficient Communication Over the Discrete-Time Memoryless Rayleigh Fading Channel with Turbo Coding/Decoding
✍ Peleg, Michael ;Shamai(Shitz), Shlomo 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 1002 KB

## Abstract Communication over the discrete time memoryless Rayleigh fading channel is investigated. Codes achieving bit error rate (BER) lower than 10‐^4^ at bit energy over the noise spectral density ratio (__E~b~/N~o~__) of 1 to 2dB from the channel capacity limit were found with coding rates of

On the graphical containment of discrete
On the graphical containment of discrete metric spaces
✍ David P. Dailey 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 911 KB

This paper presents certain definitions, results and problems concerning the problem of representing a finite metric space with integer distances within a graph. Results are derived for the special cases of "regular" metric spaces, very small metric spaces, and for those metric spaces contained by c

A Riccati equation approach to the robus
A Riccati equation approach to the robust memoryless stabilization of discrete time-delay systems
✍ Chien-Hua Lee; Tzuu-Hseng S. Li; Fan-Chu Kung 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 327 KB

By applyin 9 a Riccati equation approach, this' paper presents a new memoryless .feedback controller Jor stabilizin 9 a class of discrete systems with an unknown state delay. By evaluatin9 the tolerable system uncertain ty bounds, the robustness c?f this memoryless feedback controller is also invest