✦ LIBER ✦

Bounds on the rank and kernel of perfect codes

✍ Scribed by Kevin T. Phelps; Mercè Villanueva

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 102 KB
Volume: 10
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00399-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Non - Existence of Perfect Codes

On the Non - Existence of Perfect Codes with Rank Distance

✍ Kefei Chen 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 347 KB

Theory of codes with rank distance was introduced in 1985, which can be applied to crisscross error correction and also used to build some cryptographical schemes. We know that the existence of perfect codes is an interesting topic in coding theory; as a new type of codes, we consider the existence

On a class of kernel-perfect and kernel-

On a class of kernel-perfect and kernel-perfect-critical graphs

✍ Kiran B. Chilakamarri; Peter Hamburger 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 275 KB

Chilakamarri, K.B. and P. Hamburger, On a class of kernel-perfect and kernel-perfect-critical graphs, Discrete Mathematics 118 (1993) 253-257. In this note we present a construction of a class of graphs in which each of the graphs is either kernel-perfect or kernel-perfect-critical. These graphs or

On the non-existence of perfect and near

On the non-existence of perfect and nearly perfect codes

✍ Peter Hammond 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 479 KB

On the non-existence of certain perfect

On the non-existence of certain perfect mixed codes

✍ G.J.M.van Wee 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 229 KB

It is shown that if a nontrivial perfect mixed e-code in Q, x Q2 x . . . x Q, exists, where the Qi are alphabets of size qi, then the qt, e and n satisfy certain divisibility conditions.

On the approximation of kernel operators

On the approximation of kernel operators by operators of finite rank

✍ H.H Schaefer; U Schlotterbeck 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 380 KB

New Bounds on the Distance Distribution

New Bounds on the Distance Distribution of Extended Goppa Codes

✍ Simon Litsyn; Sarit Zur 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 169 KB

We derive new estimates for the error term in the binomial approximation to the distance distribution of extended Goppa codes. This is an improvement on the earlier bounds by Vladuts and Skorobogatov, and Levy and Litsyn.