✦ LIBER ✦

Optimum probabilities of messages with preassigned code words

✍ Scribed by Sze-hou Chang

Book ID: 126670804
Publisher: IEEE
Year: 1963
Tongue: English
Weight: 206 KB
Volume: 51
Category: Article
ISSN: 0018-9219
DOI: 10.1109/PROC.1963.2306

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The existence of sampling designs with p

The existence of sampling designs with preassigned inclusion probabilities

✍ S. Gabler; R. Schweigkoffer 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 270 KB

Optimum codes for small values of channe

Optimum codes for small values of channel error probability (Corresp.)

✍ Cordaro, J.; Wagner, T. 📂 Article 📅 1967 🏛 IEEE 🌐 English ⚖ 298 KB

Reliability of Hamming code transmission

Reliability of Hamming code transmission versus error probability on message bits

✍ D. Kaur; D. Wedding II 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 184 KB

Improved bounds on the word error probab

Improved bounds on the word error probability of RA(2) codes with linear-programming-based decoding

✍ Halabi, N.; Even, G. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 541 KB

Near-optimum serial concatenation of sin

Near-optimum serial concatenation of single-parity codes with convolutional codes

✍ Wei, L. 📂 Article 📅 2005 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 221 KB

On computing the number of code words wi

On computing the number of code words with minimum weight for cyclic codes

✍ Masami Mohri; Masakatsu Morii 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 264 KB 👁 2 views

The weight distribution is an important parameter that determines the performance of a code. The minimum distance and the number of corresponding codes that can be derived from the weight distribution, greatly affect the performance of the code. The decoding error probability and other performance m