✦ LIBER ✦

On Perfect Codes: Rank and Kernel

✍ Scribed by Kevin T. Phelps; Mercè Villanueva

Book ID: 110391794
Publisher: Springer
Year: 2002
Tongue: English
Weight: 104 KB
Volume: 27
Category: Article
ISSN: 0925-1022
DOI: 10.1023/a:1019936019517

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds on the rank and kernel of perfect

Bounds on the rank and kernel of perfect codes

✍ Kevin T. Phelps; Mercè Villanueva 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 102 KB

On the Ranks and Kernels Problem for Per

On the Ranks and Kernels Problem for Perfect Codes

✍ S. V. Avgustinovich; F. I. Solov'eva; O. Heden 📂 Article 📅 2003 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 112 KB

A remark on full rank perfect codes

✍ Olof Heden 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 172 KB

Rank and kernel of binary Hadamard codes

✍ Phelps, K.T.; Rifa, J.; Villanueva, M. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 210 KB

The rank and kernel of extended 1-perfec

The rank and kernel of extended 1-perfect Z4-linear and additive non-Z4-linear codes

✍ Borges, J.; Phelps, K.T.; Rifa, J. 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 443 KB

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