𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improved Bounds for Quaternary Linear Codes of Dimension 6

✍ Scribed by T. Aaron Gulliver; Patric R.J. Östergård

Publisher
Springer
Year
1998
Tongue
English
Weight
83 KB
Volume
9
Category
Article
ISSN
0938-1279

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear Programming Bounds for Codes of S
Linear Programming Bounds for Codes of Small Size
✍ Ilia Krasikov; Simon Litsyn 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 255 KB

Combining linear programming with the Plotkin -Johnson argument for constant weight codes , we derive upper bounds on the size of codes of length n and minimum distance 3 ) these bounds practically coincide with (are slightly better than) the Tieta ¨ va ¨ inen bound . For j fixed and for j proporti

On the nonexistence of some quaternary l
On the nonexistence of some quaternary linear codes meeting the Griesmer bound
✍ Noboru Hamada 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 176 KB

It is unknown whether or not there exists a quaternary linear code with parameters [293, 5, 219], [289, 5, 216] or [277, 5, 207]. The purpose of this paper is to prove the nonexistence of quaternary linear codes with parameters [