✦ LIBER ✦

On the Minimum Distances of Non-Binary Cyclic Codes

✍ Scribed by Pascale Charpin; Aimo Tietäväinen; Victor Zinoviev

Book ID: 110262732
Publisher: Springer
Year: 1999
Tongue: English
Weight: 33 KB
Volume: 17
Category: Article
ISSN: 0925-1022
DOI: 10.1023/a:1008354504832

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounding minimum distances of cyclic cod

Bounding minimum distances of cyclic codes using algebraic geometry

✍ Nigel Boston 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 527 KB

On the minimum average distance of binar

On the minimum average distance of binary constant weight codes

✍ Shu-Tao Xia; Fang-Wei Fu; Yong Jiang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 172 KB

On Upper Bounds for Minimum Distance and

On Upper Bounds for Minimum Distance and Covering Radius of Non-binary Codes

✍ Tero Laihonen; Simon Litsyn 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 329 KB

Binary construction of quantum codes of

Binary construction of quantum codes of minimum distances five and six

✍ Ruihu Li; Xueliang Li 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 171 KB

On computing the minimum distance of lin

On computing the minimum distance of linear codes

✍ Masami Mohri; Masakatu Morii 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB 👁 2 views

The weight distribution is an indispensable parameter in the performance evaluation of a code because of its importance in the analysis of the codes characteristics. Since the amount of computation needed to determine the overall weight distribution of a code usually depends on the number of data po

Two new bounds on the size of binary cod

Two new bounds on the size of binary codes with a minimum distance of three

✍ Yaron Klein; Simon Litsyn; Alexander Vardy 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 442 KB