A Class of Three-Weight Linear Codes and Their Complete Weight Enumerators

January 11, 2016 · Declared Dead · 🏛 Cryptography and Communications

👻 CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Shudi Yang, Zheng-An Yao, Chang-An Zhao arXiv ID 1601.02320 Category cs.IT: Information Theory Citations 29 Venue Cryptography and Communications Last Checked 3 months ago
Abstract
Recently, linear codes constructed from defining sets have been investigated extensively and they have many applications. In this paper, for an odd prime $p$, we propose a class of $p$-ary linear codes by choosing a proper defining set. Their weight enumerators and complete weight enumerators are presented explicitly. The results show that they are linear codes with three weights and suitable for the constructions of authentication codes and secret sharing schemes.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Information Theory

Died the same way — 👻 Ghosted