✦ LIBER ✦

On the complexity of some coding problems (Corresp.)

✍ Scribed by Ntafos, S.; Hakimi, S.

Book ID: 114635113
Publisher: IEEE
Year: 1981
Tongue: English
Weight: 546 KB
Volume: 27
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.1981.1056419

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the inherent intractability of certai

On the inherent intractability of certain coding problems (Corresp.)

✍ Berlekamp, E.; McEliece, R.; van Tilborg, H. 📂 Article 📅 1978 🏛 IEEE 🌐 English ⚖ 582 KB

The Parametrized Complexity of Some Fund

The Parametrized Complexity of Some Fundamental Problems in Coding Theory

✍ Downey, Rod G.; Fellows, Michael R.; Vardy, Alexander; Whittle, Geoff 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 502 KB

On Robinson's coding problem (Corresp.)

✍ Klove, T. 📂 Article 📅 1983 🏛 IEEE 🌐 English ⚖ 618 KB

On the complexity of decoding Goppa code

On the complexity of decoding Goppa codes (Corresp.)

✍ Sarwate, D. 📂 Article 📅 1977 🏛 IEEE 🌐 English ⚖ 789 KB

On the minimum distance of some BCH code

On the minimum distance of some BCH codes (Corresp.)

✍ Cohen, G. 📂 Article 📅 1980 🏛 IEEE 🌐 English ⚖ 130 KB

Some comments on N-orthogonal codes (Cor

Some comments on N-orthogonal codes (Corresp.)

✍ Einarsson, G. 📂 Article 📅 1967 🏛 IEEE 🌐 English ⚖ 268 KB