𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Non - Existence of Perfect Codes with Rank Distance

✍ Scribed by Kefei Chen

Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
347 KB
Volume
182
Category
Article
ISSN
0025-584X

No coin nor oath required. For personal study only.

✦ Synopsis

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 of the perfect rank distance codes and prove that there are no non-trivial perfect codes with rank metric.

1991 Mathematics Subject Classification. Keywords and phrases.

📜 SIMILAR VOLUMES

On the Existence of Elliptic Curves of M
On the Existence of Elliptic Curves of Mordell–Weil Rank 6 with Four Parameters
✍ Hizuru Yamagishi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 92 KB

We construct an elliptic curve defined over Q with Mordell᎐Weil rank G 6 as a generic twist by a certain quadratic extension. Moreover, since they have four independent parameters, they give us rather a large supply of elliptic curves defined over Q with rank G 6. As an application, we find infinite

Upper Bounds on the Covering Radius of a
Upper Bounds on the Covering Radius of a Code with a Given Dual Distance
✍ S. Litsyn; A. Tietäväinen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 235 KB

We derive new upper bounds on the covering radius of a binary linear code as a function of its dual distance and dual-distance width . These bounds improve on the Delorme -Sole ´ -Stokes bounds , and in a certain interval for binary linear codes they are also better than Tieta ¨ va ¨ inen's bound .