Inequivalent cyclic codes of prime length (Corresp.)

DOI10.1109/TIT.1986.1057213zbMATH Open0619.94014MaRDI QIDQ3757827FDOQ3757827

Authors: Donald W. Newhart 

Publication date: 1986

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Recommendations

• Some cyclic codes of prime-power length
• Cyclotomy and duadic codes of prime lengths
• Indecomposability of cyclic codes
• Cyclic Codes From the Two-Prime Sequences
• Cyclotomic Constructions of Cyclic Codes With Length Being the Product of Two Primes
• scientific article; zbMATH DE number 218558
• Primitive idempotents of irreducible cyclic codes of length \(n\)
• scientific article; zbMATH DE number 7434616
• scientific article; zbMATH DE number 139906
• Binary cyclic codes with two primitive nonzeros

zbMATH Keywords

affine groupequivalence classes of prime-length cyclic codesorbits of k-sets

Mathematics Subject Classification ID

Cyclic codes (94B15)

Cited In (10)

• Multipliers and generalized multipliers of cyclic objects and cyclic codes
• Q-codes
• On the equivalence of cyclic and quasi-cyclic codes over finite fields
• On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes
• A solution of an equivalence problem for semisimple cyclic codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• (L,g)-codes and binary forms
• Triadic codes

This page was built for publication: Inequivalent cyclic codes of prime length (Corresp.)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3757827)