✦ LIBER ✦

A New Upper Bound for the Dimension of Trace Codes

✍ Scribed by van der Vlugt, M.

Book ID: 120092901
Publisher: Oxford University Press
Year: 1991
Tongue: English
Weight: 126 KB
Volume: 23
Category: Article
ISSN: 0024-6093
DOI: 10.1112/blms/23.4.395

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new upper bound for error-correcting c

A new upper bound for error-correcting codes

✍ Johnson, S. 📂 Article 📅 1962 🏛 IEEE 🌐 English ⚖ 742 KB

A new upper bound for the VC-dimension o

A new upper bound for the VC-dimension of visibility regions

✍ Gilbers, Alexander; Klein, Rolf 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 516 KB

A new upper bound for binary codes with

A new upper bound for binary codes with minimum distance four

✍ Jun Kyo Kim; Sang Geun Hahn 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 134 KB

The purpose of this paper is to give an upper bound for A [n,4], the maximum number of codewords in a binary code of length n with minimum distance d between codewords.

A new upper bound on the minimum distanc

A new upper bound on the minimum distance of turbo codes

✍ Perotti, A.; Benedetto, S. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 552 KB

A table of upper bounds for binary codes

✍ Agrell, E.; Vardy, A.; Zeger, K. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 249 KB

Improved upper bound for the redundancy

Improved upper bound for the redundancy of fix-free codes

✍ Yekhanin, S. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 158 KB