✦ LIBER ✦

Construction of self-dual normal bases and their complexity

✍ Scribed by François Arnault; Erik Jarl Pickett; Stéphane Vinatier

Book ID: 113623092
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 227 KB
Volume: 18
Category: Article
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2011.10.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Nonexistence of Self-Dual Normal Bases

✍ Kang, Dong Seung 📂 Article 📅 2004 🏛 Taylor and Francis Group 🌐 English ⚖ 158 KB

Normal Bases and Their Dual–Bases over F

Normal Bases and Their Dual–Bases over Finite Fields

✍ Qun Ying Liao; Qi Sun 📂 Article 📅 2005 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 123 KB

Cohomology and self-dual normal bases fo

Cohomology and self-dual normal bases for infinite Galois field extensions

✍ Patrik Lundström 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 122 KB

Constructions of generalized concatenate

Constructions of generalized concatenated codes and their trellis-based decoding complexity

✍ Morelos-Zaragoza, R.; Fujiwara, T.; Kasami, T.; Shu Lin 📂 Article 📅 1999 🏛 IEEE 🌐 English ⚖ 284 KB

A Deterministic Construction of Normal B

A Deterministic Construction of Normal Bases With Complexity O(n3 + n log n log(log n) log q)

✍ Alain Poli 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 385 KB

Constructing normal bases of \(G F\left(q^{n}\right)\) over \(G F(q)\) can be done by probabilistic methods as well as deterministic ones. In the following paper we consider only deterministic constructions. As far as we know, the best complexity for probabilistic algorithms is \(O\left(n^{2} \log ^

Characterization and synthesis of self-c

Characterization and synthesis of self-complementary normal bases in finite fields

✍ Abraham Lempel 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 746 KB