𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fully Ramified Characters and Clifford Codes

✍ Scribed by Nicolás, Alejandro P.; Martínez, Consuelo; Grassl, Markus


Book ID
126833219
Publisher
Taylor and Francis Group
Year
2010
Tongue
English
Weight
185 KB
Volume
39
Category
Article
ISSN
0092-7872

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


On fully ramified Brauer characters
✍ Navarro, Gabriel; Späth, Britta; Tiep, Pham Huu 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 337 KB
Bruck nets, codes, and characters of loo
✍ G. Eric Moorhouse 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 846 KB

Numerous computational examples suggest that if 9"(, k 1 C 9Z k arc (k 1)-and k-nets of order n, then rankp 0Z~ -rankp 9Zk\_ I \_> n -k + 1 ~br any prime p dividing n at most once. We conjecture that this inequality always holds. Using characters of loops, we verify the conjecture in case k = 3, pro

Linear Codes and Character Sums
✍ Nathan Linial*; Alex Samorodnitsky† 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 344 KB