Cyclic codes of length \(2^m\)

DOI10.1007/BF02829612zbMath1004.94030MaRDI QIDQ1348751

Manju Pruthi

Publication date: 25 January 2003

Published in: Proceedings of the Indian Academy of Sciences. Mathematical Sciences (Search for Journal in Brave)

zbMATH Keywords

idempotentscyclic codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15)

Related Items (15)

The minimum Hamming distances of the irreducible cyclic codes of length ⋮ Group algebras and coding theory ⋮ Some special cyclic codes of length 2n ⋮ Some classes of semisimple group (and loop) algebras over finite fields. ⋮ Some cyclic codes of length \(2p^n\) ⋮ Minimal cyclic codes of length \(p^{n} q\). ⋮ Primitive idempotents of irreducible cyclic codes of length \(n\) ⋮ Primitive idempotents in group algebras and minimal abelian codes ⋮ The primitive idempotents and weight distributions of irreducible constacyclic codes ⋮ Minimal cyclic codes of length \(p^nq\) ⋮ On the Performance of TDMA Protocols Under Self-Similar Traffic: A Simulation Study ⋮ Primitive idempotents of cyclic codes of length \(p\) and 2\(p\) ⋮ Unnamed Item ⋮ The minimum Hamming distances of irreducible cyclic codes ⋮ Irreducible cyclic codes of length \(4p^n\) and \(8p^n\)

Cites Work

• Minimal codes of prime-power length.
• Minimal cyclic codes of length \(2p^n\)
• Unnamed Item
• Unnamed Item

This page was built for publication: Cyclic codes of length \(2^m\)