✦ LIBER ✦

On efficient balanced codes over the mth roots of unity

✍ Scribed by Mascella, R.; Tallini, L.G.; Al-Bassam, S.; Bose, B.

Book ID: 114640227
Publisher: IEEE
Year: 2006
Tongue: English
Weight: 197 KB
Volume: 52
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2006.872981

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the matrices with constant determinan

On the matrices with constant determinant and permanent over roots of unity

✍ S. Akbari; H.-R. Fanaı̈; K. Mahmoudian 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 161 KB

Let µ m be the group of mth roots of unity. In this paper it is shown that if m is a prime power, then the number of all square matrices (of any order) over µ m with non-zero constant determinant or permanent is finite. If m is not a prime power, we construct an infinite family of matrices over µ m

Generalised Sarwate bounds on the aperio

Generalised Sarwate bounds on the aperiodic correlation of sequences over complex roots of unity

✍ Peng, D.Y.; Fan, P.Z. 📂 Article 📅 2004 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 309 KB