✦ LIBER ✦

On the least covering radius of binary linear codes with small lengths

✍ Scribed by Baicheva, T.; Vavrek, V.

Book ID: 114637068
Publisher: IEEE
Year: 2003
Tongue: English
Weight: 236 KB
Volume: 49
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2002.808099

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the covering radius of binary codes (

On the covering radius of binary codes (Corresp.)

✍ Helleseth, T.; Klove, T.; Mykkeltveit, J. 📂 Article 📅 1978 🏛 IEEE 🌐 English ⚖ 257 KB

On the covering radius of binary, linear

On the covering radius of binary, linear codes meeting the Griesmer bound

✍ Busschbach, P.; Gerretzen, M.; van Tilborg, H. 📂 Article 📅 1985 🏛 IEEE 🌐 English ⚖ 439 KB

Bounds on the Covering Radius of Linear

Bounds on the Covering Radius of Linear Codes

✍ A. Ashikhmin; A. Barg 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 86 KB

On the covering radius of long binary BC

On the covering radius of long binary BCH codes

✍ A Tietäinen 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 98 KB

Asymptotic bounds on the covering radius

Asymptotic bounds on the covering radius of binary codes

✍ Sole, P. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 300 KB

On the covering radius of cyclic linear

On the covering radius of cyclic linear codes and arithmetic codes

✍ Tor Helleseth 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 781 KB

The problem of finding the covering radius and minimum distance of algebraic and arithmetic codes is shown to be related to Waring's problem i n a finite field and to the theory of cyclotomic numbers. The methods devel oped l ead to new results for the covering radius of certain f-errorcorrecting BC