Minimal cyclic codes of length \(8p^n\) over \(\mathrm{GF}(q)\), where \(q\) is prime power of the form \(8k+5\)

DOI10.1007/s12190-014-0791-4zbMath1320.94104OpenAlexW2177942078MaRDI QIDQ2346484

Jagbir Singh, Suresh Kumar Arora

Publication date: 2 June 2015

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-014-0791-4

zbMATH Keywords

group algebraprimitive idempotentscyclotomic cosets

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ Unnamed Item

Cites Work

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

This page was built for publication: Minimal cyclic codes of length \(8p^n\) over \(\mathrm{GF}(q)\), where \(q\) is prime power of the form \(8k+5\)