✦ LIBER ✦

A note on asymptotically catastrophic convolutional codes of rate (n-1)/n

✍ Scribed by Hole, K.J.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for determining if a rate (

✍ Hole, K.J. 📂 Article 📅 1991 🏛 IEEE 🌐 English ⚖ 399 KB

A random coding bound for fixed convolut

✍ Seguin, G. 📂 Article 📅 1994 🏛 IEEE 🌐 English ⚖ 282 KB

A Low Complexity Stack Decoder for a Cla

✍ Vinck, A. 📂 Article 📅 1984 🏛 IEEE 🌐 English ⚖ 418 KB

Constructions of rate (n-1)/n punctured

✍ Lee, P.J. 📂 Article 📅 1988 🏛 IEEE 🌐 English ⚖ 460 KB

Tight bounds on the minimum average weig

✍ Hole, M.F.; Hole, K.J. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 225 KB

On (n,n-1) Punctured Convolutional Codes

✍ Katsiotis, A.; Kalouptsidis, N. 📂 Article 📅 2011 🏛 IEEE 🌐 English ⚖ 164 KB